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,695 papers · 148 categories

Trend · papers per month

72143215286 · Jun 202019922001200920172026
48 results for Mini-max convergence

New method uses public data to achieve optimal nonparametric classification with privacy constraints.

problem Optimal nonparametric classification under local differential privacy constraints.
method Locally differentially private classification tree with data-driven pruning.
result Achieves mini-max optimal convergence rate with public data.

This paper analyzes divide-and-conquer estimators for functional linear regression without assuming target function in the RKHS.

problem Functional linear regression without target function in RKHS.
method Integral operator approach to establish upper bounds and prove asymptotic optimality.
result Sharp finite sample upper bounds and asymptotic optimality of divide-and-conquer estimators.

Standard adversarial training involves two agents, namely a generator and a discriminator, playing a mini-max game. However, even if the players converge to an equilibrium, the generator may only recover a part of the target data distribution, in a situation commonly referred to as mode collapse. In this work, we prese…

2019-02-21abs ↗pdf ↗

Novel unsupervised MIG detectors improve signal detection in cluttered environments.

problem Signal detection in nonhomogeneous clutter environments.
method Developed novel discriminative MIG detectors using HPD matrices and geometric measures.
result Improved signal detection performance compared to conventional methods.

This work analyzes how overparameterization aids GANs in reaching global saddle points.

problem Understanding the role of overparameterization in GANs for convergence to global saddle points.
method Theoretical and empirical analysis of overparameterized GANs with various architectures and datasets.
result GDA converges to a global saddle point in overparameterized GANs with certain assumptions.

We consider the off-policy estimation problem of estimating the expected reward of a target policy using samples collected by a different behavior policy. Importance sampling (IS) has been a key technique to derive (nearly) unbiased estimators, but is known to suffer from an excessively high variance in long-horizon pr…

2018-10-29abs ↗pdf ↗

Active learning aims to develop label-efficient algorithms by sampling the most representative queries to be labeled by an oracle. We describe a pool-based semi-supervised active learning algorithm that implicitly learns this sampling mechanism in an adversarial manner. Unlike conventional active learning algorithms, o…

2019-03-31abs ↗pdf ↗

The paper studies adversarial training for linear regression models.

problem Understanding the tradeoffs between robust and standard accuracy in adversarial training.
method Characterizes the fundamental tradeoff and specific adversarial training approach for linear regression with Gaussian features.
result Precise characterization of the standard and robust accuracy tradeoff in high-dimensional settings.

This is an intuitive survey of extrinsic and intrinsic notions of convergence of manifolds complete with pictures of key examples and a discussion of the properties associated with each notion. We begin with a description of three extrinsic notions which have been applied to study sequences of submanifolds in Euclidean…

2010-06-02abs ↗pdf ↗

The abstract discusses convergence properties of Lipschitz functions and sets defined by equations.

problem Convergence of Lipschitz functions and sets defined by equations.
method Painlevé-Kuratowski convergence applied to Lipschitz functions and sets defined by equations.
result Generalizations and reverses of classical theorems on convergence of functions and sets.

The objective of this paper is to introduce the notion of generalized almost statistical (briefly, GAS) convergence of bounded real sequences, which generalizes the notion of almost convergence as well as statistical convergence of bounded real sequences. As a special kind of Banach limit functional, we also introduce …

2019-11-15abs ↗pdf ↗

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.

New quasi-Newton method guarantees global superlinear convergence.

problem Global convergence and superlinear convergence of quasi-Newton methods.
method Hybrid proximal extragradient method with online learning for Hessian approximation.
result First globally convergent quasi-Newton method with explicit superlinear convergence rate.

We investigate finite-time decoupled convergence in nonlinear two-time-scale stochastic approximation.

problem Achieving decoupled convergence in nonlinear two-time-scale stochastic approximation.
method Nested local linearity assumption, suitable step size selection, convergence analysis of matrix cross term, fourth-order moment convergence rates.
result Finite-time decoupled convergence rates can be achieved in nonlinear two-time-scale stochastic approximation with proper step size selection.

The article introduces a new convergence concept for Lorentzian spaces and applies it to generalized cones.

problem Stability of curvature bounds in generalized Lorentzian cones.
method Introduces \ell-convergence for Lorentzian pre-length spaces, applies it to generalized cones, and proves stability of curvature bounds.
result Sharp timelike curvature and curvature-dimension bounds for generalized cones are established.

Study shows gap between uniform convergence and test error in random feature models.

problem Understanding the gap between uniform convergence and test error in random feature models.
method Analytical expressions for uniform convergence over norm balls, interpolators, and minimum norm interpolator risk derived and proved.
result Uniform convergence over interpolators still gives a non-trivial bound of test error even when classical uniform convergence is vacuous.

The paper examines convergence of distances in Lipschitz structures on manifolds.

problem Convergence of distances in Lipschitz vector fields and norms on manifolds.
method Analysis of convergence of distances associated to converging structures of Lipschitz vector fields and norms.
result Under mild controllability assumption, distances converge locally uniformly to the limit Carnot-Carathéodory distance.

We introduce a natural definition of LpL^p-convergence of maps, p1p \ge 1, in the case where the domain is a convergent sequence of measured metric space with respect to the measured Gromov-Hausdorff topology and the target is a Gromov-Hausdorff convergent sequence. With the LpL^p-convergence, we establish a theory of …

2005-05-20abs ↗pdf ↗

DCDC calculates convergence rates for Markov chains using neural networks.

problem Computing precise convergence rates for Markov chains is hard.
method Developed a neural network-based algorithm (DCDC) to bound convergence rates in Wasserstein distance.
result Demonstrated effective convergence bounds for real-world Markov chains.

The paper provides convergence guarantees for multicalibration gradient boosting.

problem Understanding the convergence properties of multicalibration gradient boosting.
method Computational guarantees for multicalibration gradient boosting algorithms, including adaptive variants.
result The magnitude of successive prediction updates decays at O(1/T)O(1/\sqrt{T}), leading to convergence in empirical multicalibration error.