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

20 results for “non-Euclidean optimisation”

CS papers only

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

Want pure semantic search? Try claim verification →

math.OCcs.LGstat.MLTheoreticalRecentJun 12, 2026

Free Heavy-Tailed Lunch for Muon: A Theoretical Justification of Empirical Success

Florian Hübler, Thomas Pethick, Suvrit Sra

This paper analyzes the theoretical advantages of non-Euclidean optimisation methods for training Transformer models.

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 →
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 →
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.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 →
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 →
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.NEcs.AIcs.SCRecentMay 27, 2026

Improving Evaluation of Recombination-based Cartesian Genetic Programming

Duy Long Tran, Anja Jankovic, Marie Anastacio, Holger Hoos +1 more

This paper demonstrates that optimizing hyperparameters for two specific recombination operators can significantly improve the performance of Cartesian Genetic Programming, which traditionally relies…

View →
cs.NEcs.AIcs.DSRecentMay 28, 2026

Selection Hyper-heuristics Can Automatically Adjust the Learning Period to Optimally Solve Pseudo-Boolean Problems

Benjamin Doerr, Pietro S. Oliveto, John Alasdair Warwicker

This paper introduces a method to automatically determine the optimal learning period ($ au$) for the Random Gradient hyper-heuristic, enabling it to optimally solve Pseudo-Boolean Problems without ma…

View →
cs.DSTheoreticalRecentSep 18, 2026

Faster SVP in Polynomial Space

Yansong Feng, Yiming Gao, Jiaqi Liu

The paper presents a randomized algorithm that solves the exact Euclidean shortest vector problem in polynomial space and improved time complexity.

View →
cs.PLcs.MSTheoreticalRecentOct 30, 2026

Grassmann: The Coordinate-Independent Linear Algebra Programming Language

Theadora Fields Collin, Gilbert Bernstein, Oded Stein, Saman Amarasinghe

The paper proposes a language called Grassmann that bridges coordinate-independent linear algebra and coordinate-dependent implementations.

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 →
cs.LGmath.OCstat.MLTheoreticalRecentJun 29, 2026

Curvature-Weighted Gradient Diversity: A Noise Measure for Geometry-Adaptive SGD Schedules

Muhammad Hamza, Ayush Goel

This paper introduces Curvature-Weighted Gradient Diversity (CWGD), a geometry-aware measure for optimization noise that reduces the asymptotic optimization error floor by up to a factor of two compar…

View →
math.COcs.CCTheoreticalRecentJul 9, 2026

Polynomial Binary Optimization

Endre Boros

The paper develops an explicit multi-linear polynomial form for binary polynomial optimization problems after eliminating a subset of variables, allowing for characterization of new special classes wi…

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 →