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

20 results for “adjoint optimization”

CS papers only

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

Want pure semantic search? Try claim verification →

physics.opticscond-mat.dis-nneess.SPEmpiricalRecentOct 26, 2026

Physical Adjoint Learning in Wave Systems with Asymmetric Couplings

Lucas J. Fernández-Alcázar, John Guillamon, Krishna Joshi, Tsampikos Kottos

Develops an in-situ adjoint optimization framework for nonreciprocal wave systems.

View →
cs.LGcs.AIcs.CERecentJun 1, 2026

On the Generalization in Topology Optimization via Sensitivity-Conditioned Bernoulli Flow Matching

Mohammad Rashed, Duarte F. Valoroso Madeira, Babak Gholami, Caglar Guerbuez +2 more

The paper proposes using pseudo-sensitivities, derived from adjoint sensitivity fields, as an optimal conditioning signal in a Bernoulli flow-matching framework to significantly improve the out-of-dis…

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 →
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 →
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.LGEmpiricalRecentJul 8, 2026

Neural Operator-enabled Topology-informed Evolutionary Strategy for PDE-Constrained Optimization

Xiangming Huang, Guannan Zhang, Lu Lu, Raphaël Pestourie

This paper introduces NOTES, a method for efficient and transferable inverse design of physical systems using neural operators, dimensionality reduction, and evolutionary optimization.

View →
cs.NEEmpiricalRecentJul 18, 2026

Hybrid Augmented Lagrangian Method for General Constrained Optimization via Evolutionary Algorithms

Lampros Printzios, Konstantinos Chatzilygeroudis

This paper proposes a Hybrid Augmented Lagrangian (HyAL) method that integrates the constraint-handling strengths of the AL framework with the exploratory power of population-based search.

View →
cs.LGmath.OCstat.MLEmpiricalRecentJul 26, 2026

A Multi-stage Constrained Optimization Framework for Data-driven Problems

Ye Shi

This paper proposes a Multi-stage Constrained Optimization Framework (MCOF) for Variational Autoencoders (VAEs) to address challenges in sampling, identifying active decision variables, and enforcing…

View →
cs.LGcs.AIRecentJun 1, 2026

FOAM: Frequency and Operator Error-Based Adaptive Damping Method for Reducing Staleness-Oriented Error for Shampoo

Kyunghun Nam, Sumyeong Ahn

The paper proposes FOAM, an adaptive damping method that stabilizes the Shampoo optimization algorithm by dynamically controlling damping and eigendecomposition frequency, thereby reducing staleness-i…

View →
math.OCcs.DSTheoreticalRecentJun 15, 2026

Adaptive Proximal Methods for Weakly Convex Optimization with Unknown Parameter: Deterministic and Stochastic Guarantees

Miaolan Xie

This paper proposes a one-trial proximal algorithm for minimizing nonsmooth, nonconvex objectives with unknown weak-convexity parameter.

View →
math.OCcs.ROEmpiricalRecentJun 23, 2026

Parallel Dynamic Programming for Conic Linear Quadratic Control

Luyao Zhang, Gabriel Bravo-Palacios, Brian Plancher, Sergio Grammatico

The paper presents a parallel-in-time approach to solve computationally demanding conic optimal control problems using the alternating direction method of multipliers.

View →
stat.MLcs.LGmath.OCTheoreticalRecentJul 20, 2026

An Adjoint-Sensitivity Framework for Lost-in-the-Middle Phenomena in Causal Residual Transformers

Cheng Huan, Hongwei Yuan

This paper develops an adjoint-sensitivity framework for positional influence in causal residual Transformers and provides theoretical results on the residual-to-depth-flow estimate and finite-token-t…

View →
math.NAcs.CEmath-phRecentMay 28, 2026

Multifidelity Proper Orthogonal Decomposition

Nicole Aretz, Karen Willcox

The paper introduces Multifidelity Proper Orthogonal Decomposition (MFPOD), a method that significantly reduces the computational cost of dimension reduction by intelligently combining data from cheap…

View →
cs.AImath.OCRecentJun 1, 2026

Stochastic convergence of parallel asynchronous adaptive first-order methods

Serge Gratton, Philippe L. Toint

The paper analyzes a new class of asynchronous adaptive first-order optimization methods and proves their stochastic convergence rate is O(1/sqrt{t}) for non-convex functions.

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 →