ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “differentiable optimizer”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.PLcs.LGcs.SCEmpiricalRecentJun 7, 2026

Compile Once, Differentiate Everywhere: A Differentiable Meta-Circular Interpreter

Lucas Sheneman

The paper presents a compiler that translates Scheme into differentiable computation graphs, enabling the use of code as a learnable scientific model.

View →
math.OCcs.CCcs.LGSurveyRecentOct 29, 2026

Stochastic and Noisy Oracles in Smooth Continuous Optimization

Albert S. Berahas, Liyuan Cao, Katya Scheinberg

This paper reviews models of inexact computational oracles in smooth continuous optimization and their implications for optimization algorithms.

View →
math.OCcs.LGstat.MLEmpiricalRecentJun 15, 2026

Functional Gradient Descent with Adaptive Representations

Daniel Csillag, Rodrigo Schuller, Pedro Dall'Antonia, Leonidas Guibas +2 more

This paper proposes a new functional gradient descent algorithm that adapts the representation of functional gradients over the course of optimization, providing convergence guarantees and outperformi…

View →
math.OCcs.LGstat.MLTheoreticalRecentJun 21, 2026

Adam Converges in Nonsmooth Nonconvex Optimization

Zijian Liu

The paper provides a finite-time analysis of the Adam optimizer for nonsmooth nonconvex optimization, proving a convergence rate of $1/T^{2/13}$ with a randomly scaled learning rate.

View →
cs.NEcs.AIcs.LGEmpiricalRecentJun 10, 2026

Mathematical perspective on genetic algorithms with optimization guided operators

Anna Brandenberger, Ilan Doron-Arad, Elchanan Mossel

This paper introduces a general model of genetic algorithms and studies their optimization problems using reinforcement learning.

View →
cs.LGcs.AImath.OCRecentMay 28, 2026

Singularity-aware Optimization via Randomized Geometric Probing: Towards Stable Non-smooth Optimization

Ruoran Xu, Borong She, Xiaobo Jin, Qiufeng Wang

The paper introduces Singularity-aware Adam (S-Adam), a novel optimizer that stabilizes deep learning training in non-smooth loss landscapes by dynamically damping updates based on local geometric ins…

View →
cs.LGstat.MLRecentJun 1, 2026

Local Preferential Bayesian Optimization

Johanna Menn, Miriam Kober, Paul Brunzema, David Stenger +1 more

The paper introduces local Preferential Bayesian Optimization (PBO) methods that adapt high-dimensional Bayesian Optimization techniques, such as trust-region and derivative-informed local search, to…

View →
math.OCcs.LGEmpiricalRecentOct 19, 2026

Newton-Based Methods for Bilevel Optimization Beyond Lower-Level Strong Convexity

Youran Dong, Junfeng Yang, Wei Yao, Jin Zhang

This paper proposes new methods for bilevel optimization in machine learning tasks.

View →
cs.LGmath.OCstat.MLTheoreticalRecentJul 20, 2026

Optimizing the Preconditioner: A Black-box Online-to-Nonconvex Conversion with Static Regret Minimization Oracles

Haichen Hu, David Simchi-Levi

This paper shows that stochastic nonconvex optimization can be reduced to ordinary static regret minimization in online convex optimization, and establishes convergence rates for smooth and Lipschitz…

View →
cs.LGmath.OCstat.MLEmpiricalRecentJun 18, 2026

On the Oracle Complexity of Interpolation-Based Gradient Descent

Dongmin Lee, William Lu, Anuran Makur

The paper proposes an inexact gradient method, PPI-GD, that improves the oracle complexity of gradient descent for smooth loss functions.

View →
cs.AIcs.NEEmpiricalRecentOct 16, 2026

Algorithm Modelization: Transforming Optimization Algorithms into Evolvable Intelligence

Jian Yao, Zhiyao Zhang, Yichen Li, Xingyu Wu +1 more

This paper introduces Algorithm Modelization, a paradigm that turns iterative algorithms into trainable models.

View →
cs.NEEmpiricalRecentJun 19, 2026

On the Use of Survival Selection Methods for Evolutionary Diversity Optimisation

Adel Nikfarjam, Jakob Bossek, Aneta Neumann, Frank Neumann

This paper investigates the benefits of generating multiple solutions in each generation for Evolutionary Diversity Optimisation (EDO) and proposes efficient methods to achieve it.

View →
math.OCcs.LGcs.NETheoreticalRecentJun 12, 2026

Operator Calculus for Population-Based Optimization: A Mean-Field Convergence Theory

Pekka Malo, Lauri Viitasaari, Patrik Nummi, Antti Suominen +2 more

The paper introduces an operator calculus for population-based optimization methods, establishing a modular Lyapunov principle for their convergence analysis.

View →
cs.DMTheoreticalRecentJun 27, 2026

Local Minima in Quadratic-Penalty Relaxations of Binary Linear Programs

Cheng-Han Huang, Yongliang Sun, Chaoyan Huang, Ismail Alkhouri +1 more

The paper establishes conditions for QUBO formulations of combinatorial optimization problems that guarantee valid binary and feasible local minimizers using gradient-based methods.

View →
cs.NEcs.LGEmpiricalRecentJun 30, 2026

Evaluation of Population Initialization Methods for Genetic Programming-based Symbolic Regression

Lukas Kammerer, Gabriel Kronberger, Deaglan J. Bartlett, Harry Desmond +2 more

This paper compares the effect of different initialization methods on the accuracy and complexity of solutions in genetic programming for symbolic regression, finding no significant differences.

View →
math.OCcs.DMTheoreticalRecentJun 16, 2026

An Adaptive Algorithm for the Approximation of General Linear-Parametric Optimization Problems

Levin Nemesch, Stefan Ruzika, Clemens Thielen, Alina Wittmann

A new algorithm is proposed for approximating solutions to linear-multi-parametric optimization problems with negative parameter dependencies and non-fixed parameter sets.

View →
cs.LGcs.CREmpiricalRecentJun 22, 2026

TROPT: An Open Framework for Unifying and Advancing Discrete Text Optimization

Matan Ben-Tov, Mahmood Sharif

The paper presents TROPT, an open-source framework that unifies discrete optimizers' execution and standardizes their development under a single interface.

View →
cs.DScs.AIcs.CCTheoreticalRecentAug 17, 2026

Improving the matrix multiplication exponent with modern optimization and AlphaEvolve

Emilien Dupont, Marvin Eisenberger, Borislav Kozlovskii, Abbas Mehrabian +6 more

The paper improves the optimization problem at the core of the laser method for obtaining matrix multiplication bounds, yielding a new upper bound of ω < 2.371177.

View →