20 results for “non-Euclidean optimisation”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
This paper analyzes the theoretical advantages of non-Euclidean optimisation methods for training Transformer models.
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.
A new algorithm is proposed for approximating solutions to linear-multi-parametric optimization problems with negative parameter dependencies and non-fixed parameter sets.
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.
This paper investigates the benefits of generating multiple solutions in each generation for Evolutionary Diversity Optimisation (EDO) and proposes efficient methods to achieve it.
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.
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…
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…
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…
The paper presents a randomized algorithm that solves the exact Euclidean shortest vector problem in polynomial space and improved time complexity.
The paper proposes a language called Grassmann that bridges coordinate-independent linear algebra and coordinate-dependent implementations.
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…
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…
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…
This paper reviews models of inexact computational oracles in smooth continuous optimization and their implications for optimization algorithms.