Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

2725458171,089 · Jun 202019922001200920172026
48 results for second order optimization

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.

Exact second-order optimization for deep learning reduces computational cost and improves performance.

problem Inadequate use of second-order optimization methods in deep learning due to high computational cost and non-convexity.
method Developed an exact stochastic second-order Newton method that addresses the non-convexity issue and provides an expression for the stochastic Hessian.
result Exact second-order Newton direction formula and its application in deep learning datasets.

Second-order guarantees for federated learning algorithms.

problem Non-convex optimization in federated learning with saddle-points as bottlenecks.
method Drawing on recent results on second-order optimality in centralized and decentralized settings, establish second-order guarantees for federated learning algorithms.
result Established second-order guarantees for federated learning algorithms.

Second-order methods improve differential privacy in convex optimization.

problem Improving differential privacy in convex optimization.
method Developed a private variant of the regularized cubic Newton method for strongly convex loss functions.
result Achieves quadratic convergence and optimal excess loss for strongly convex loss functions.

AdaSub optimizes with second-order info in low-dims subspace.

problem Efficiently use second-order optimization methods with low computational cost.
method Adaptive subspace selection for second-order optimization.
result AdaSub outperforms other stochastic optimizers in time and iterations.

Second-order optimization speeds up deep hedging for complex options.

problem Hedging exotic options with market frictions in realistic markets.
method Second-order optimization scheme leveraging pathwise differentiability and Kronecker-factoring.
result Our method optimizes the policy in 1/4 the steps of standard optimization.

Data whitening and second order optimization harm generalization by reducing access to dataset information.

problem Harmful effects of data whitening and second order optimization on generalization in machine learning.
method Analysis of fully connected models and experimental verification.
result Data whitening and second order optimization reduce or prevent generalization by limiting access to dataset information.

New algorithm finds approximate stationary points in non-convex optimization.

problem Finding approximate stationary points in non-convex stochastic optimization.
method Design of an algorithm using O(ε3)O(ε^{-3}) stochastic gradient and Hessian-vector products.
result Optimal rate of O(ε3)O(ε^{-3}) for finding εε-approximate stationary points, matching lower bounds.

A new method for faster optimization of noisy functions.

problem Optimizing noisy functions efficiently.
method A universal and adaptive second-order method for convex functions.
result Achieves O(σ/T)O(σ/ \sqrt{T}) convergence for stochastic oracles and O(1/T3)O( 1 / T^3) for deterministic oracles.

New Lagrangian approach for optimal control of second-order systems.

problem Optimal control of second-order differential equations derived from force-controlled Lagrangian systems.
method Proposes a new hyperregular control Lagrangian and control Hamiltonian, providing necessary optimality conditions.
result Defines an extended Tulczyjew's triple with controls and studies the relationship between Noether symmetries.

Optimization in machine learning, both theoretical and applied, is presently dominated by first-order gradient methods such as stochastic gradient descent. Second-order optimization methods, that involve second derivatives and/or second order statistics of the data, are far less prevalent despite strong theoretical pro…

2020-02-20abs ↗pdf ↗

Two new algorithms improve federated optimization under second-order similarity.

problem Federated learning under communication constraints and second-order similarity.
method SVRP and Catalyzed SVRP algorithms combining proximal point evaluations, client sampling, and variance reduction.
result Achieves superior performance and uniformly improves upon existing algorithms for federated optimization under second-order similarity and strong convexity.

Optimistic method adapted for faster convex-concave min-max problems.

problem Solving convex-concave min-max optimization problems efficiently.
method Adaptive, line search-free second-order methods combining optimistic updates and second-order information.
result Achieves optimal convergence rate without line search or backtracking.

AdamQLR optimizes Adam with K-FAC heuristics, achieving comparable performance to tuned benchmarks.

problem Improving the performance of Adam optimizers with stabilizing heuristics.
method Combining Adam's update directions with K-FAC's heuristics (damping and learning rate selection).
result Untuned AdamQLR can achieve comparable performance to tuned benchmarks.

Paper proposes a new method for efficient second-order neural network training.

problem Infeasibility of Hessian calculation and noisy second-order information in deep learning.
method Adopting complex-step directional derivative (CSFD) for accurate Hessian computation and designing an effective Newton Krylov procedure.
result Our method outperforms existing methods and often converges one-order faster.

Managing a portfolio to a risk model can tilt the portfolio toward weaknesses of the model. As a result, the optimized portfolio acquires downside exposure to uncertainty in the model itself, what we call "second order risk." We propose a risk measure that accounts for this bias. Studies of real portfolios, in asset-by…

2009-08-17abs ↗pdf ↗

SOAR improves deep networks' robustness against adversarial examples.

problem Improving deep neural networks' robustness against adversarial examples.
method Formulated adversarial robustness problem under robust optimization framework, approximated loss function using second-order Taylor series expansion.
result SOAR significantly improves robustness of networks against adversarial perturbations.

Paper proposes a method to find approximate SOSP for nonconvex conic optimization problems.

problem Finding approximate second-order stationary points in nonconvex conic optimization.
method Newton-CG based barrier method with complexity guarantees.
result Achieves iteration complexity of O(ε^(-3/2)) for finding (ε,√ε)-SOSP.

Variance reduction techniques like SVRG provide simple and fast algorithms for optimizing a convex finite-sum objective. For nonconvex objectives, these techniques can also find a first-order stationary point (with small gradient). However, in nonconvex optimization it is often crucial to find a second-order stationary…

2019-05-01abs ↗pdf ↗

ADAHESSIAN optimizes machine learning models with adaptive second-order methods.

problem Efficiently optimizing machine learning models with second-order methods.
method Dynamic Hessian estimation via adaptive estimates, incorporating fast approximations and moving averages.
result ADAHESSIAN achieves state-of-the-art performance across various tasks.

COMRADE is a communication-efficient, Byzantine-resilient second-order optimization algorithm.

problem Byzantine failures in distributed optimization.
method COMRADE is a communication-efficient, second-order optimization algorithm that uses a simple norm-based thresholding rule to filter out Byzantine workers.
result COMRADE achieves linear-quadratic convergence and is robust against Byzantine workers.

New algorithm reduces regret in stochastic bandit convex optimization.

problem Optimizing decisions in uncertain environments with convex losses.
method Introduces a second-order method for zeroth-order stochastic convex bandits.
result Regret bound of (1+r/d)[d1.5n+d3]polylog(n,d,r)(1 + r/d)[d^{1.5} \sqrt{n} + d^3] polylog(n, d, r).

The paper analyzes second-order guarantees for optimization in various architectures.

problem Nonconvex optimization problems are difficult to solve, especially verifying local minima.
method Second-order guarantees for stochastic first-order optimization algorithms in different architectures.
result Gradient perturbations help algorithms distinguish and avoid undesirable stationary points.

We consider distributed optimization problems where forming the Hessian is computationally challenging and communication is a significant bottleneck. We develop unbiased parameter averaging methods for randomized second order optimization that employ sampling and sketching of the Hessian. Existing works do not take the…

2020-02-16abs ↗pdf ↗

New method finds stationary points in bilevel optimization problems.

problem Solving nonconvex-strongly-convex bilevel optimization problems.
method Restarted Accelerated HyperGradient Descent (RAHGD) method.
result Achieves best-known theoretical guarantees for finding stationary points in bilevel optimization.

Negative step sizes improve second-order methods for neural networks.

problem Second-order methods discard negative curvature, limiting their effectiveness.
method Introduce negative step sizes in second-order methods combined with Wolfe line search.
result Negative step sizes lead to global convergence and improved performance.

Paper uses second-order differential geometry to study stochastic mechanics.

problem Stochastic differential equations and their symmetries.
method Develops second-order differential geometry to study symmetries of SDEs and constructs stochastic mechanics.
result Establishes stochastic Lagrangian and Hamiltonian mechanics and their relations with HJB equations.

Paper optimizes trading strategies by creating shadow prices for markets with transaction costs.

problem Optimizing trading strategies in markets with transaction costs.
method Developed shadow prices to simplify optimization into a frictionless market, considering second-order transaction costs.
result Alternative strategies outperform shadow prices for risk aversion different from one.

The paper debiases mini-batch approximations in deep learning for more accurate optimization and uncertainty quantification.

problem Bias in mini-batch approximations distorts the shape of quadratic approximations used in deep learning.
method Developed and evaluated debiasing strategies for mini-batch approximations.
result Debiasing strategies improve the accuracy of second-order optimization and uncertainty quantification in deep learning.

Paper discusses optimal CP for second-order predictions.

problem How to incorporate second-order predictions into conformal prediction.
method Introduces Bernoulli prediction sets (BPS) for second-order predictions and applies conformal risk control for compromised validity.
result BPS provides the smallest prediction sets with conditional coverage.

The paper is mainly devoted to systematic developments and applications of geometric aspects of second-order variational analysis that are revolved around the concept of parabolic regularity of sets. This concept has been known in variational analysis for more than two decades while being largely underinvestigated. We …

2019-08-31abs ↗pdf ↗

A new optimization method improves deep learning accuracy without hyper-parameter tuning.

problem Computational demands and convergence behavior in deep learning training.
method Stochastic quasi-Gauss-Newton (SQGN) optimization method combining stochastic quasi-Newton, Gauss-Newton, and variance reduction.
result SQGN provides excellent accuracy without hyper-parameter experimentation, improving convergence and computational performance.

Improved Local SGD convergence for general convex objectives with bounded second-order heterogeneity.

problem Understanding when and why Local SGD outperforms alternatives in distributed optimization.
method Established improved convergence guarantees for Local SGD on general convex objectives under bounded second-order heterogeneity.
result Upper bounds for Local SGD are nearly tight, providing a sharper convergence theory.

A new method for optimizing deep neural networks using TKFAC.

problem Optimizing deep neural networks with second-order methods.
method Proposes Trace-restricted Kronecker-factored Approximate Curvature (TKFAC) for Fisher information matrix approximation.
result TKFAC improves performance on deep network architectures compared to state-of-the-art algorithms.

Constrained second-order convex optimization algorithms are the method of choice when a high accuracy solution to a problem is needed, due to their local quadratic convergence. These algorithms require the solution of a constrained quadratic subproblem at every iteration. We present the \emph{Second-Order Conditional G…

2020-02-20abs ↗pdf ↗

Value iteration is a fixed point iteration technique utilized to obtain the optimal value function and policy in a discounted reward Markov Decision Process (MDP). Here, a contraction operator is constructed and applied repeatedly to arrive at the optimal solution. Value iteration is a first order method and therefore …

2019-05-10abs ↗pdf ↗

New method solves stochastic optimization problems with random models.

problem Optimizing stochastic objectives with deterministic constraints.
method Trust-Region Sequential Quadratic Programming with random model.
result Global convergence guarantees for first- and second-order stationary points.

Improved algorithm finds second-order stationary points in non-convex optimization.

problem Minimizing non-convex objectives while preserving training data privacy.
method SpiderBoost framework with two gradient oracles: precise and less precise.
result Improved rates for finding second-order stationary points.