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.

169,051 papers · 148 categories

Trend · papers per month

4489133177 · Jun 202019922001200920182026
48 results for Iterative re-clustering

Improved space management in iterative clustering reduces subset growth without sacrificing performance.

problem Iterative re-clustering of speech segments can lead to unchecked subset growth, compromising performance.
method Integration of a space management strategy into the iterative process of hierarchical clustering.
result No loss in performance in terms of F-measure while guaranteeing space complexity.

Paper analyzes iterates in high-dimensional linear models and proposes estimators for their generalization error.

problem Analyzing iterates in high-dimensional linear models with comparable feature and sample sizes.
method Novel estimators for generalization error, debiasing corrections, and valid confidence intervals.
result Estimators are n\sqrt{n}-consistent and can be used for early stopping.

Paper analyzes iterative learning for concept classes and learns half-spaces.

problem Learning concept classes efficiently with iterative learners.
method Analyzes various settings of iterative learning and provides a constructive algorithm for half-spaces.
result Constructive iterative algorithm for learning half-spaces from informant.

WaveFit uses fixed-point iteration to create high-quality neural vocoders.

problem Creating high-quality neural vocoders with fast inference.
method Integrates GANs' adversarial training into a DDPM-like iterative framework based on fixed-point iteration.
result WaveFit synthesizes speech with naturalness comparable to human speech, and is significantly faster than existing methods.

Last iterate of Extragradient algorithm converges slower than averaged iterates in saddle point problems.

problem Smooth convex-concave saddle point problems
method Analysis of Extragradient (EG) algorithm convergence rates
result The last iterate of EG converges at a rate of O(1/√T), compared to O(1/T) for averaged iterates

In this paper, we introduce the notions of an iterated planar Lefschetz fibration and an iterated planar open book decomposition and prove the Weinstein conjecture for contact manifolds supporting an open book that has iterated planar pages. For n1n\geq 1, we show that a (2n+1)(2n+1)-dimensional contact manifold MM suppor…

2017-10-20abs ↗pdf ↗

Sharp analysis of power iteration for tensor PCA, improving convergence and stopping criteria.

problem Analyzing the power iteration algorithm for tensor PCA to improve convergence and stopping criteria.
method Sharp bounds on the number of iterations, revealing a smaller algorithmic threshold, proposing a stopping criterion.
result Sharp bounds on the number of iterations required for power method to converge, revealing a smaller algorithmic threshold than previously conjectured.

We deduce from the work of Chen, that the restriction morphism from closed free iterated integrals to closed iterated integrals on loops is onto. We use this to show that the module of higher order invariants of smooth functions is generated by free closed iterated integrals.

2010-11-15abs ↗pdf ↗

Adaptive optimal control of nonlinear dynamic systems with deterministic and known dynamics under a known undiscounted infinite-horizon cost function is investigated. Policy iteration scheme initiated using a stabilizing initial control is analyzed in solving the problem. The convergence of the iterations and the optim…

2015-05-20abs ↗pdf ↗

Study Ricci iteration on spheres and projective spaces, proving existence and convergence.

problem Existence and behavior of Ricci iteration on spheres and projective spaces.
method Ricci iteration, Hopf fibration, prescribed Ricci curvature equation.
result Existence and convergence of Ricci iteration on 3-sphere confirmed, partial results in higher dimensions.

Iterative method learns unknown constraints for MPC control.

problem Learning to satisfy unknown polyhedral state constraints in iterative MPC.
method Collects and improves estimates of unknown constraints using collected data, designs an MPC controller to satisfy the estimated constraints.
result Robust and probabilistic guarantees of constraint satisfaction as a function of task iterations.

OMWU shows last iterate convergence in convex-concave games.

problem Optimizing in constrained min-max optimization landscapes.
method OMWU (Optimistic Multiplicative-Weights Update) in the no-regret online learning framework.
result OMWU exhibits last iterate convergence for convex-concave games, generalizing previous results.

Iterated Amplification uses subproblem solutions to build training signals for complex tasks.

problem Learning complex tasks when humans can't directly evaluate performance.
method Progressively builds training signal by combining solutions to easier subproblems.
result Efficiently learns complex behaviors in algorithmic environments.

In this paper we investigate what kind of manifolds arise as the total spaces of iterated S1S^1-bundles. A real Bott tower studied in \cite{CMO}, \cite{KM} and \cite{KN} is an example of an iterated S1S^1-bundle. We show that the total space of an iterated S1S^1-bundle is homeomorphic to an infra-nilmanifold. A real Bo…

2011-08-01abs ↗pdf ↗

Improved generalization with iterate averaging and adaptive algorithms.

problem Enhancing model generalization performance in high-dimensional settings.
method Gaussian process perturbation model, combine IA with large learning rates and regularisation, less frequent averaging, adaptive gradient methods.
result Iterate averaging with adaptive algorithms significantly outperforms SGD on various datasets.

DSPI connects natural policy gradient to policy iteration, proving global convergence.

problem Optimizing policies in reinforcement learning.
method DSPI framework, combining smoothed policy iteration and natural policy gradient.
result DSPI achieves geometric convergence and optimal complexity for policy optimization.

Strong stability of ergodic iterations proven without ergodic driving sequence.

problem Ensuring strong stability of ergodic iterations under non-ergodic driving sequences.
method Revisiting processes driven by stationary ergodic sequences, proving strong stability under mild conditions on recursive maps.
result Strong stability of iterations proven without ergodic driving sequence.

Enhances single-step adversarial training to defend against iterative adversarial examples.

problem Defending against iterative adversarial examples in neural networks.
method Identified and leveraged empirical properties of Iter-Adv to improve Single-Adv.
result Enhanced Single-Adv to defend against iterative adversarial examples with improved accuracy and reduced training cost.

New convergence rates for shuffling gradient methods without strong convexity.

problem Theoretical gap between shuffling gradient methods' empirical success and established convergence rates.
method Proved last-iterate convergence rates for shuffling gradient methods using function value gap.
result First last-iterate convergence rates for shuffling gradient methods without strong convexity.

Paper refutes conjecture on tensor power iteration convergence in overcomplete models.

problem Understanding convergence of tensor power iteration in overcomplete random tensors.
method Analysis of tensor power iteration dynamics from random initialization.
result Polynomially many steps are necessary for convergence, refutes logarithmic conjecture.

We study iteration maps of recurrence relations arising from mutation periodic quivers of arbitrary period. Combining tools from cluster algebra theory and (pre)symplectic geometry, we show that these cluster iteration maps can be reduced to symplectic maps on a lower dimensional submanifold, provided the matrix repres…

2013-07-01abs ↗pdf ↗

The Ricci iteration is a discrete analogue of the Ricci flow. We give the first study of the Ricci iteration on a class of Riemannian manifolds that are not Kähler. The Ricci iteration in the non-Kähler setting exhibits new phenomena. Among them is the existence of so-called ancient Ricci iterations. As we show, these …

2016-06-16abs ↗pdf ↗

This study analyzes adversarial training on linearly separable data and finds that gradient updates can achieve large margins in polynomial iterations.

problem Ensuring robustness in machine learning models trained on linearly separable data.
method Analysis of adversarial training with gradient updates on linearly separable data.
result Gradient updates in adversarial training can achieve large margins in polynomial iterations, whereas non-smooth methods require exponentially many iterations.

Last SGD iterate bounds for overparameterized linear regression.

problem Analyzing the last iterate risk bounds of SGD with decaying stepsize for overparameterized linear regression.
method Problem-dependent analysis of last iterate risk bounds of SGD with geometrically decaying stepsize.
result Proved nearly matching upper and lower bounds on the excess risk for last iterate SGD with geometrically decaying stepsize.

We consider the infinite-horizon discounted optimal control problem formalized by Markov Decision Processes. We focus on several approximate variations of the Policy Iteration algorithm: Approximate Policy Iteration, Conservative Policy Iteration (CPI), a natural adaptation of the Policy Search by Dynamic Programming a…

2014-05-12abs ↗pdf ↗

New method improves subspace iteration for eigenvectors in machine learning.

problem Computing eigenvectors for large-scale problems in machine learning.
method Subspace iteration with 2o\ell_{2 o \infty} norm convergence analysis.
result Deterministic bounds and practical stopping criterion for improved performance.

We give a definition of higher dimensional iterated integrals based on integration over membranes. We prove basic properties of this definition and formulate a conjecture which extends Chen's de Rham Theorem for iterated integrals to the membrane case.

2012-03-16abs ↗pdf ↗

Improved matching for multiple objects using a novel reweighting method.

problem Current multi-object matching methods have limitations and are not robust.
method Proposes a novel iterative reweighting strategy using the graph connection Laplacian.
result Demonstrates superior performance over state-of-the-art methods.

OptEx accelerates first-order optimization with parallelized iterations.

problem Inefficiencies in first-order optimization algorithms for complex tasks.
method Approximately parallelized iterations using kernelized gradient estimation.
result OptEx achieves substantial efficiency improvements with an effective acceleration rate of Ω(N)Ω(\sqrt{N}).