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

2955908851,180 · Jun 202019922001200920172026
48 results for zero-order methods

CyBeR-0 optimizes federated learning with Byzantine resilience and reduced communication costs.

problem Byzantine attacks and communication inefficiency in federated learning.
method Transformed robust aggregation for zero-order optimization under client heterogeneity.
result CyBeR-0 achieves stable performance with minimal communication costs and reduced memory usage.

Study optimizes zero-order strongly convex function minimization with higher order smoothness.

problem Optimizing a strongly convex function with noisy evaluations.
method Randomized approximation of projected gradient descent with smoothing kernel.
result Upper bounds and minimax lower bounds for the algorithm, showing near-optimality.

A new gradient estimator for online optimization with two function evaluations.

problem Online optimization of convex and Lipschitz functions with noisy data.
method L1-randomization approach for gradient estimation.
result Compared or better guarantees than previous methods for canceling noise.

The paper analyzes the efficiency of gradient estimation methods in noisy function evaluations.

problem Estimating gradients of smooth functions using noisy function evaluations.
method Information-theoretic lower bounds and finite difference method analysis.
result The finite difference method is not minimax optimal, suggesting room for improvement in gradient estimation.

New algorithm optimizes convex functions with noisy evaluations in one dimension.

problem Optimizing convex functions with noisy zero-order evaluations in one dimension.
method Proposed a computationally efficient algorithm achieving O(1/T)O(1/\sqrt{T}) convergence rate.
result Achieved the optimal O(1/T)O(1/\sqrt{T}) convergence rate, closing the gap in one dimension.

The problem of resource allocation of nonlinear networked control systems is investigated, where, unlike the well discussed case of triggering for stability, the objective is optimal triggering. An approximate dynamic programming approach is developed for solving problems with fixed final times initially and then it is…

2014-12-17abs ↗pdf ↗

A new method for distributed optimization with noisy function evaluations.

problem Distributed optimization with noisy function evaluations.
method Zero-order one-point estimate with distributed stochastic gradient-tracking technique.
result The method converges almost surely to the optimum with a rate of O(1k)O(\frac{1}{\sqrt{k}}).

Derivative-free method solves stochastic optimization problems with noisy objectives and constraints.

problem Solving nonlinear optimization problems with stochastic objectives and deterministic constraints using only zero-order information.
method Derivative-Free Stochastic Sequential Quadratic Programming (DF-SSQP) method using simultaneous perturbation stochastic approximation (SPSA) for gradient and Hessian estimation.
result Global almost-sure convergence of the DF-SSQP method under standard assumptions, with local asymptotic normality and statistical inference.

Paper tackles dynamic pricing in a geometrically decaying environment, achieving better occupancy with lower rates.

problem Minimizing expected loss in a dynamically changing environment with decisions dependent on the data distribution.
method Introduces algorithms for information and loss function settings, using repeated decision deployment to allow mixing of the environment.
result Iteration complexity matches first and zero order stochastic gradient methods up to logarithmic factors.

We show that the eigenvalues of the intrinsic Dirac operator on the boundary of a Euclidean domain can be obtained as the limits of eigenvalues of Euclidean Dirac operators, either in the domain with a MIT-bag type boundary condition or in the whole space, with a suitably chosen zero order mass term.

2018-11-08abs ↗pdf ↗

This paper tackles the computational complexity of finding approximate stationary points in non-convex optimization.

problem Finding approximate stationary points in non-convex optimization problems.
method PLS-completeness, zero-order algorithms, and gradient queries.
result The query complexity of finding approximate stationary points is Θ(1/ε) for d=2.

Improved analysis and new algorithm for gradient-free optimization of smooth functions.

problem Minimization of highly smooth functions with noisy oracle information.
method Two zero-order projected gradient descent algorithms based on randomization over the 2\ell_2 and 1\ell_1 spheres, with improved analysis and theoretical guarantees.
result Improved convergence rates and theoretical guarantees for various function classes.

A stochastic model for pure-jump diffusion (the compound renewal process) can be used as a zero-order approximation and as a phenomenological description of tick-by-tick price fluctuations. This leads to an exact and explicit general formula for the martingale price of a European call option. A complete derivation of t…

2012-02-20abs ↗pdf ↗

We propose a novel interpretation of the collapsed variational Bayes inference with a zero-order Taylor expansion approximation, called CVB0 inference, for latent Dirichlet allocation (LDA). We clarify the properties of the CVB0 inference by using the alpha-divergence. We show that the CVB0 inference is composed of two…

2012-06-27abs ↗pdf ↗

In this small note we use results derived in Berestycki et al. to correct the celebrated formulae of Hagan et al. We derive explicitly the correct zero order term in the expansion of the implied volatility in time to maturity. The new term is consistent as β1β\to 1. Furthermore, numerical simulations show that it reduc…

2007-08-07abs ↗pdf ↗

Reinforcement learning algorithms, though successful, tend to over-fit to training environments hampering their application to the real-world. This paper proposes WR2L\text{W}\text{R}^{2}\text{L} -- a robust reinforcement learning algorithm with significant robust performance on low and high-dimensional control tasks. Ou…

2019-07-30abs ↗pdf ↗

Gradient-free optimization for additive models achieves optimal error.

problem Optimizing noisy functions with zero-order information.
method Proposed a randomized gradient estimator for gradient-free optimization.
result Achieves minimax optimal error of order dT(β1)/βdT^{-(β-1)/β}.

We consider spaces of smooth immersed plane curves (modulo translations and/or rotations), equipped with reparameterization invariant weak Riemannian metrics involving second derivatives. This includes the full H2H^2-metric without zero order terms. We find isometries (called RR-transforms) from some of these spaces i…

2013-11-14abs ↗pdf ↗

Let MM be a complete Riemannian manifold and let Ω(M)Ω^*(M) denote the space of differential forms on MM. Let d:Ω(M)Ω+1(M)d:Ω^*(M) \to Ω^{*+1}(M) be the exterior differential operator and let $\Del=dd^*+d^*d$ be the Laplacian. We establish a sufficient condition for the Schroedinger operator $H=\Del+V(x)$ (where the potential $V…

1996-07-28abs ↗pdf ↗

This work speeds up hyperparameter selection for non-smooth convex models using implicit differentiation.

problem Optimizing hyperparameters of non-smooth convex models.
method Implicit differentiation of proximal gradient and coordinate descent methods.
result Implicit differentiation can speed up hyperparameter optimization, especially for non-smooth problems.

The paper calculates option prices using Mellin transform for stochastic volatility models.

problem Calculating prices for path-dependent options under stochastic volatility.
method Asymptotic approach and Mellin transform for deriving closed-form formulas.
result Derives closed-form formulas for option prices with first-order approximation.

John Lott has computed an integer-valued signature for the orbit space of a compact orientable (4k+1)(4k+1) manifold with a semi-free S1S^1-action, which is a homotopy invariant of that space, but he did not construct a Dirac type operator which has this signature as its index. In this Thesis, we construct such operator on…

2017-11-11abs ↗pdf ↗

ZeroS improves Transformers by adding negative weights, matching or beating softmax attention.

problem Limited performance of linear attention methods, especially in long context sequences.
method Proposes Zero-Sum Linear Attention (ZeroS) that removes the zero-order term and reweights zero-sum softmax residuals.
result ZeroS matches or exceeds standard softmax attention across various benchmarks, theoretically expanding representable functions.

The digital telecommunications receiver is an important context for inference methodology, the key objective being to minimize the expected loss function in recovering the transmitted information. For that criterion, the optimal decision is the Bayesian minimum-risk estimator. However, the computational load of the Bay…

2018-11-03abs ↗pdf ↗

We introduce a new stochastic smoothing perspective to study adversarial contextual bandit problems. We propose a general algorithm template that represents random perturbation based algorithms and identify several perturbation distributions that lead to strong regret bounds. Using the idea of smoothness, we provide an…

2018-10-11abs ↗pdf ↗

The paper proves Gorenstein contractions for multiscale differentials on nodal curves.

problem Proving Gorenstein contractions for multiscale differentials on nodal curves.
method Addressing the conjecture by Ranganathan and Wise, showing contractions level by level.
result Multiscale differentials can be contracted to Gorenstein singularities, level by level, from the top down.

Study meromorphic k-differentials with prescribed singularities on Riemann surfaces.

problem Understanding local invariants of meromorphic k-differentials on Riemann surfaces.
method Analyzing orders of zeros and poles, and k-residues at poles.
result For a given pattern of zeros, there exists a primitive holomorphic k-differential with these zeros.

Proposes a method for private aggregation in heterogeneous federated learning.

problem Ensuring resilience to Byzantine clients and maintaining client data privacy in federated learning with heterogeneous data.
method Careful co-design of verifiable secret sharing, secure aggregation, and private information retrieval scheme.
result Achieves information-theoretic privacy guarantees and Byzantine resilience under data heterogeneity.

We apply random matrix theory to compare correlation matrix estimators C obtained from emerging market data. The correlation matrices are constructed from 10 years of daily data for stocks listed on the Johannesburg Stock Exchange (JSE) from January 1993 to December 2002. We test the spectral properties of C against ra…

2004-02-14abs ↗pdf ↗

Unified interpretation of sub-Riemannian Gauss-Bonnet theorem for surfaces in 3D contact manifolds.

problem Proving a sub-Riemannian Gauss-Bonnet theorem for surfaces in 3D contact manifolds.
method Measure-theoretic perspective, focusing on singular measures and characteristic points.
result Unified interpretation of previous results and natural geometric conditions for the theorem.

Despite the fact that an intraday market price distribution is not normal, the random walk model of price behaviour is as important for the understanding of basic principles of the market as the pendulum model is a starting point of many fundamental theories in physics. This model is a good zero order approximation for…

2019-08-12abs ↗pdf ↗