GeoAdaLer enhances geometric understanding of Adam for stochastic optimization.
problem Understanding geometric principles behind Adam's success in stochastic optimization.
method Introduces GeoAdaLer, an adaptive learning method based on geometric properties.
result Extends interpretability and effectiveness in complex optimization scenarios.
Introduces a new geometric method for optimal experimental design.
problem Restrictive invariance properties of traditional OED approaches based on probability densities.
method Mutual transport dependence (MTD) using optimal transport theory.
result Demonstrates high-quality designs and flexibility compared to standard methods.
Solves optimal liquidation problem for stock price following geometric Brownian motion.
problem Optimal liquidation problem for stock price process following geometric Brownian motion.
method Functional analysis tools; working in terms of cash.
result Explicit solution to the problem, extending to stochastic drift.
Randomized Geometric Algebra for Convex Neural Networks Optimizes Transfer Learning.
problem Training neural networks to global optimality via convex optimization.
method Randomized algorithms in Clifford's Geometric Algebra for hypercomplex vector spaces.
result Convex optimization and geometric algebra improve LLMs' robustness and reliability in transfer learning.
Geometric approach combines asset returns and investor views for better portfolio optimization.
problem Optimizing portfolios with investor-specific views.
method Generalized Wasserstein barycenter (GWB) to integrate statistical asset returns and investor views.
result The geometric approach offers more flexibility and rewards for correct investor views.
Geometric structure reveals optimal investment and hedging products.
problem Optimal design of investment and hedging products.
method Investigation of geometric structure in risks and returns using a simple formula.
result Duality between hedging and investment with geometric interpretation of rationality.
Introduces optimization geometrodynamics for dynamic geometric optimization.
problem Gradient-based optimization methods struggle with changing geometric constraints.
method Optimization geometrodynamics separates invariant and improvable geometric mismatches.
result Dynamic geometric complexity measures the minimum geometric cost to reduce optimization difficulty.
NDM incorporates geometric structure into neural networks for better optimization and interpretability.
problem Efficient and interpretable deep learning architectures.
method NDM is a neural network architecture that explicitly incorporates geometric structure into its design, using a Coordinate Layer, Geometric Layer, and Evolution Layer.
result NDM provides intrinsic regularization, enhancing generalization and robustness.
Enhances quantum circuit synthesis using deep learning and geometric methods.
problem Optimizing quantum circuits for time efficiency.
method Combining deep learning with geometric control techniques.
result Improved time-optimal control in quantum circuit synthesis.
Establishes geometric convergence of iterative optimization algorithms.
problem Analyzes convergence of iterative optimization algorithms under general assumptions.
method General framework for iterative optimization algorithms, proving asymptotic geometric convergence and providing convergence rates.
result Asymptotic geometric convergence of iterative optimization algorithms with exact rate.
Geometrically reformulates the Laplace method for optimal transport.
problem Approximating integrals using the Laplace method without geometric interpretation.
method Introduces the Kim-McCann Riemannian metric to give a geometric formulation of the Laplace method.
result Expresses the first-order term of the Laplace method using geometric objects.
New geometrical method optimizes portfolio with minimal risk.
problem Optimizing portfolios with risk aversion and constraints.
method Computing generalized Euclidean distance to a simplex.
result Determines portfolios with minimal risk and high returns.
Investigates geometric mean reversion process using Lie symmetry method.
problem Describes dynamics of short-term interest rates.
method Lie symmetry method and optimal system of invariant solutions.
result Constructs an optimal system of invariant solutions.
Novel analysis of neural networks using geometric algebra and convex optimization.
problem Understanding the inner workings of deep neural networks.
method Geometric (Clifford) algebra and convex optimization.
result Optimal weights are given by the wedge product of training samples.
Optimal geometric estimates for Kähler manifolds with bounded Nash entropy
problem Optimal geometric estimates for compact Kähler manifolds
method Proving Sobolev-type inequality and local volume noncollapsing with optimal exponents
result Uniformly bounded q-Nash entropy New geometric metrics improve Bayesian optimization performance evaluation.
problem Current metrics lack geometric insights and cannot compare algorithms effectively.
method Proposed four geometric metrics: precision, recall, average degree, and average distance.
result Proposed metrics provide more detailed evaluation of Bayesian optimization.
Equivalent formulations for low-rank matrix optimization are proven.
problem Low-rank matrix optimization with rank constraints.
method Established geometric landscape connections between manifold and factorization formulations.
result Equivalence between manifold and factorization formulations at FOSPs, SOSPs, and strict saddles.
Equivalence proven between algebraic stability and geometric stability.
problem Equivalence of algebraic and geometric stability criteria.
method Algebraic proof of equivalence, existence and uniqueness of minimal centers.
result Existence and uniqueness of minimal optimal destabilizing centers.
Combines Gaussian process and Geometric Harmonics for better uncertainty estimation.
problem Uncertainty estimation in kernel-based methods.
method Combines Gaussian process and Geometric Harmonics.
result Alternative interpretations of uncertainty and accelerated Bayesian Optimization.
Survey of Sinkhorn algorithm for optimal transport, emphasizing its geometric origins.
problem Solving optimal transport problems efficiently and accurately.
method Discretization of a non-linear integral equation.
result Geometric interpretation and discretization of the Sinkhorn algorithm.
In this paper, an unsupervised machine learning method for geometric constellation shaping is investigated. By embedding a differentiable fiber channel model within two neural networks, the learning algorithm is optimizing for a geometric constellation shape. The learned constellations yield improved performance to sta…
Optimal transport and information geometry both study geometric structures on spaces of probability distributions. Optimal transport characterizes the cost-minimizing movement from one distribution to another, while information geometry originates from coordinate-invariant properties of statistical inference. Their con…
Study optimal paths in Zermelo's navigation problem using geometric equations.
problem Optimal control paths in Zermelo's navigation problem.
method Geometric and differential equations approach to obtain precise ODE system.
result Obtained precise equations for optimal trajectories.
The paper studies the question of whether the classical mirror and synchronous couplings of two Brownian motions minimise and maximise, respectively, the coupling time of the corresponding geometric Brownian motions. We establish a characterisation of the optimality of the two couplings over any finite time horizon and…
Second-order optimizers retain residual information after data deletion, affecting machine unlearning.
problem Residual information in second-order optimizers after data deletion.
method Comparison of first-order and second-order learners, eigendecomposition analysis.
result Second-order optimizers retain residual information, not detectable by first-order analysis.
Geometric analysis on diffeomorphism groups for fluid dynamics and information geometry.
problem Geometric analysis of fluid flows and optimal mass transport.
method Review of metrics and topology on diffeomorphism groups.
result Introduction of new metrics and topology for diffeomorphism groups.
This paper uses a geometric approach to understand how normalization layers affect neural network optimization.
problem Understanding the effect of normalization layers on optimization in neural networks.
method Introduces a spherical framework to study optimization dynamics of neural networks with normalization layers from a geometric perspective.
result Derives the first effective learning rate expression of Adam and shows that SGD with NLs is equivalent to a constrained variant of Adam.
Study of 2D Lorentzian anti-de Sitter plane using geometric control theory.
problem Understanding extremal trajectories and reachable set on anti-de Sitter plane.
method Geometric control theory and differential geometry.
result Construction of optimal synthesis and description of Lorentzian distance.
We study the tracking of a trajectory for a nonholonomic system by recasting the problem as a constrained optimal control problem. The cost function is chosen to minimize the error in positions and velocities between the trajectory of a nonholonomic system and the desired reference trajectory, both evolving on the dist…
Survey explores geometric aspects of policy optimization in control systems.
problem Understanding the geometric relationships between control design and optimization.
method Geometric perspective on policy optimization, focusing on parameterization and topology.
result Implications of policy geometry on stability and performance of local search algorithms.
Paper shows how to use geometric median for robust SGD in high dimensions.
problem Robustifying SGD for high-dimensional optimization problems with gross corruption.
method Applying geometric median to only chosen blocks of coordinates at a time.
result Retains optimal breakdown point of 0.5 for smooth non-convex problems.
CDOT optimizes transport between domains preserving both feature and geometric structure.
problem Optimizing transport between heterogeneous domains with preserved feature and geometric structure.
method CDOT uses operator-based regularization to align distance structures, proving pseudometric properties.
result CDOT improves robustness to local geometric variations and is provably convex.
This paper proposes a new geometric model optimization method.
problem Building adaptive manifold models with dynamic geometry.
method Optimizing metric tensor field on a manifold with variational framework.
result Metric optimization yields models with greater expressive power than fixed geometry models.
Novel approach analyzes ReLU networks' training dynamics and proposes GmP for improved optimization.
problem Stochastic optimization instability in ReLU networks impedes convergence and generalization.
method Characteristic activation boundaries analysis and Geometric Parameterization (GmP) technique.
result GmP resolves instability, leading to better optimization, convergence, and generalization.
Geometric methods integrate Lie systems for optimal control problems.
problem Integrating Lie systems for optimal control problems.
method Geometric numerical methods based on Magnus expansions and Runge-Kutta-Munthe-Kaas.
result Accurate numerical solutions for Lie systems in optimal control problems.
Study on geometric variational problems for existence, regularity, and uniqueness of solutions.
problem Geometric variational problems, focusing on existence, regularity, and uniqueness of solutions.
method Formulated in Federer and Fleming's theory of currents, discussed the existence theory, and presented core ideas of the (interior) regularity theory for area-minimizing currents and optimal transport paths. Two original results on generic uniqueness of solutions were presented.
result Generic uniqueness of solutions for both Plateau's problem and optimal branched transport problem.
In this work, we show the intrinsic relations between optimal transportation and convex geometry, especially the variational approach to solve Alexandrov problem: constructing a convex polytope with prescribed face normals and volumes. This leads to a geometric interpretation to generative models, and leads to a novel …
Recent research on accelerated gradient methods of use in optimization has demonstrated that these methods can be derived as discretizations of dynamical systems. This, in turn, has provided a basis for more systematic investigations, especially into the geometric structure of those dynamical systems and their structur…
We geometrically describe optimal control problems in terms of Morse families in the Hamiltonian framework. These geometric structures allow us to recover the classical first order necessary conditions for optimality and the starting point to run an integrability algorithm. Moreover the integrability algorithm is adapt…
Autoencoder-based geometric shaping is proposed that includes optimizing bit mappings. Up to 0.2 bits/QAM symbol gain in GMI is achieved for a variety of data rates and in the presence of transceiver impairments. The gains can be harvested with standard binary FEC at no cost w.r.t. conventional BICM.
Muons and random optimizers perform similarly, challenging geometric optimization theory.
problem Empirical success of Muon optimizer challenges geometric optimization theory.
method Introducing Freon and Kaon optimizers, demonstrating performance without precise geometric structure.
result Performance of optimizers is controlled by alignment and descent potential, not geometric structure.
A geometric method optimizes over the intersection of two manifolds.
problem Optimizing over the intersection of two manifolds with coupled geometry.
method Geometric method using retraction on one manifold and orthogonal updates.
result Convergence to first-order stationarity under intrinsic transversality.
FiberNet integrates geometry into machine learning for clearer classification.
problem Lack of interpretability in traditional deep learning.
method Reformulates classification as geometric optimization on fiber bundles, introducing learnable Riemannian metrics and variational prototype optimization.
result Clear geometric interpretability and efficiency in classification.
Geometric programming approach for traffic equilibrium problems.
problem Optimizing traffic equilibrium in transportation systems.
method Finslerian dynamical model for nonlinear complementarity problems.
result Effective solution for various equilibrium problems in transportation.
Yau's Affine Normal Descent optimizes smooth unconstrained problems with geometrically adapted directions.
problem Optimizing smooth unconstrained problems with geometrically adapted directions.
method Yau's Affine Normal Descent (YAND) uses the equi-affine normal of level-set hypersurfaces as search directions.
result YAND converges globally under standard smoothness assumptions and locally quadratically near nondegenerate minimizers.
We propose a geometric algorithm for topic learning and inference that is built on the convex geometry of topics arising from the Latent Dirichlet Allocation (LDA) model and its nonparametric extensions. To this end we study the optimization of a geometric loss function, which is a surrogate to the LDA's likelihood. Ou…
Sharp ABP estimate on metric spaces via optimal transport.
problem Sharp ABP estimate on metric measure spaces.
method Optimal transport theory.
result Established a sharp ABP estimate on metric measure spaces.
PackIt creates a virtual space for testing geometric planning skills.
problem Evaluating geometric planning abilities in virtual environments.
method Developed a virtual environment, PackIt, for geometric planning tasks.
result Demonstrated the effectiveness of various methods for geometric planning.