Beyond backpropagation: implicit gradients for bilevel optimization
N. Zucchet and J. Sacramento
to appear in Neural Computation.
Large population sizes and crossover help in dynamic environments
J. Lengler, J. Meier
Natural Computing
Runtime Analysis of the (mu + 1)-EA on the Dynamic BinVal Function
J. Lengler, S. Riedi
SN Computer Science
Solving Static Permutation Mastermind using O(n log n) Queries
M. Larcher, A. Martinsson, A. Steger
Electronic Journal of Combinatorics
The
size-Ramsey number of cubic graphs
D. Conlon, R. Nenadov, M. Trujić
Bulletin of the London Mathematical Society 54, 2135-2150
Covering
cycles in sparse graphs
F. Mousset, N. Škorić, M. Trujić
Random Structures & Algorithms 60, 716-748
Triangle
resilience of the square of a Hamilton cycle in random graphs
M. Fischer, N. Škorić, A. Steger, M. Trujić
Journal of Combinatorial Theory, Series B 152, 171-220
Coloring drawings of graphs
C. Hertrich, F. Schröder, R. Steiner
Electronic Journal of Combinatorics, 29(1), P1.17
Dichromatic number and forced subdivisions
L. Gishboliner, R. Steiner, T. Szabó
Journal of Combinatorial Theory, Series B, 153, 1-30
Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant
R. Steiner
Journal of Combinatorial Theory, Series B, 155, 45-51
Even circuits in oriented matroids
K. Heuer, R. Steiner, S. Wiederrecht
Combinatorial Theory, 2(1), #3
Improved lower bound for the list chromatic number of graphs with no K_t-minor
R. Steiner
Combinatorics, Probability and Computing, 31(6), 1070-1075
Oriented cycles in digraphs of large outdegree
L. Gishboliner, R. Steiner, T. Szabó
Combinatorica
Disjoint cycles with length constraints in digraphs of large connectivity or minimum degree
R. Steiner
SIAM Journal on Discrete Mathematics, 36(2), 1343-1362
Complete directed minors and chromatic number
T. Mészáros, R. Steiner
Journal of Graph Theory, 101(4), 623-632
Topological drawings meet classical theorems from convex geometry
H. Bergold, S. Felsner, M. Scheucher, F. Schröder, R. Steiner
Discrete & Computational Geometry
Colorings of oriented planar graphs avoiding a monochromatic subgraph
H. Bergold, W. Hochstättler, R. Steiner
Discrete Applied Mathematics, 320, 81-94
Disproof of a Conjecture by Woodall
R. Steiner
Electronic Journal of Combinatorics, 29(3), P3.2
Odd Hadwiger for line graphs
R. Steiner
Discrete Mathematics, 346(1), 113196
Improved bound for improper colourings of graphs with no odd clique minor
R. Steiner
Combinatorics, Probability and Computing
Heroes in orientations of chordal graphs
P. Aboulker, G. Aubian, R. Steiner
SIAM Journal on Discrete Mathematics, 36(4), 2497-2505
On coloring digraphs with forbidden induced subgraphs
R. Steiner
Journal of Graph Theory
Matching theory and Barnette's conjecture
M. Gorsky, R. Steiner, S. Wiederrecht
Discrete Mathematics, 346(2), 113249
Cycle lengths modulo k in expanders
A. Martinsson, R. Steiner
European Journal of Combinatorics
Open-Ended Reinforcement Learning with Neural
Reward Functions
(arxiv version)
R. Meier*, A. Mujika*
36th Conference on Neural Information Processing Systems (NeurIPS 2022).
Our Poster at the Workshop "Agent Learning in Open-Endedness" at ICLR 2022
The least-control principle for learning at equilibrium
A. Meulemans*, N. Zucchet*, S. Kobayashi*, J. von Oswald and J. Sacramento
selected as an oral at the 36th Conference on Neural Information Processing Systems (NeurIPS 2022).
A contrastive rule for meta-learning
N. Zucchet*, S. Schug*, J. von Oswald*, D. Zhao and J. Sacramento
36th Conference on Neural Information Processing Systems (NeurIPS 2022).
Disentangling the Predictive Variance of Deep Ensembles through the Neural Tangent Kernel
S. Kobayashi, P. Vilimelis Aceituno, J. von Oswald
36th Conference on Neural Information Processing Systems (NeurIPS 2022).
Self-adjusting Population Sizes for the (1,lambda)-EA on Monotone Functions
M. Kaufmann, M. Larcher, J. Lengler, X. Zou
Parallel Problem Solving From Nature (PPSN 2022)
Population Diversity Leads to Short Running Times of Lexicase Selection
T. Helmuth, J. Lengler, W. La Cava
Parallel Problem Solving From Nature (PPSN 2022)
Two-Dimensional Drift Analysis: Optimizing Two Functions Simultaneously Can Be Hard
D. Janett, J. Lengler
Parallel Problem Solving From Nature (PPSN 2022)
Edge partitions of complete geometric graphs
O. Aichholzer, J. Obenaus, J. Orthaber, R. Paul, P. Schnider, R. Steiner, T. Taubner, B. Vogtenhuber
Symposium on Computational Geometry (SoCG 2022)
Exact matching in graphs of bounded independence number
N. El Maalouly, R. Steiner.
Symposium on Mathematical Foundations of Computer Science (MFCS 2022)
