Oliver Sieberling

11 papers A* 1A 1Journal 8Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
Plus Strategies are Exponentially Slower for Planted Optima of Random Height.
Algorithmica
Johannes Lengler, Leon Schiller, Oliver Sieberling
2025 J jnl
DarwinLM: Evolutionary Structured Pruning of Large Language Models.
CoRR
Shengkun Tang, Oliver Sieberling, Eldar Kurtic, Zhiqiang Shen, Dan Alistarh
2025 A* conf
EvoPress: Accurate Dynamic Model Compression via Evolutionary Search.
ICML
Oliver Sieberling, Denis Kuznedelev, Eldar Kurtic, Dan Alistarh
2025 J jnl
Hardest Monotone Functions for Evolutionary Algorithms.
SN Comput. Sci.
Marc Kaufmann, Maxime Larcher, Johannes Lengler, Oliver Sieberling
2025 J jnl
MesaNet: Sequence Modeling by Locally Optimal Test-Time Training.
CoRR
Johannes von Oswald, Nino Scherrer, Seijin Kobayashi, Luca Versari, Songlin Yang, Maximilian Schlegel, Kaitlin Maile, Yanick Schimpf, Oliver Sieberling, Alexander Meulemans, Rif A. Saurous, Guillaume Lajoie, Charlotte Frenkel, Razvan Pascanu, Blaise Agüera y Arcas, João Sacramento
2025 J jnl
Quartet: Native FP4 Training Can Be Optimal for Large Language Models.
CoRR
Roberto L. Castro, Andrei Panferov, Soroush Tabesh, Oliver Sieberling, Jiale Chen, Mahdi Nikdan, Saleh Ashkboos, Dan Alistarh
2024 J jnl
EvoPress: Towards Optimal Dynamic Model Compression via Evolutionary Search.
CoRR
Oliver Sieberling, Denis Kuznedelev, Eldar Kurtic, Dan Alistarh
2024 — conf
Hardest Monotone Functions for Evolutionary Algorithms.
EvoStar
Marc Kaufmann, Maxime Larcher, Johannes Lengler, Oliver Sieberling
2024 A conf
Plus Strategies are Exponentially Slower for Planted Optima of Random Height.
GECCO
Johannes Lengler, Leon Schiller, Oliver Sieberling
2024 J jnl
Plus Strategies are Exponentially Slower for Planted Optima of Random Height.
CoRR
Johannes Lengler, Leon Schiller, Oliver Sieberling
2023 J jnl
Hardest Monotone Functions for Evolutionary Algorithms.
CoRR
Marc Kaufmann, Maxime Larcher, Johannes Lengler, Oliver Sieberling