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

25.0%50.0%75.0%100.0% · Dec 199219922001200920182026
48 results for iterative spaces

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.

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 ↗

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.

On a smoothly stratified space, we identify intersection cohomology of any given perversity with an associated weighted L2L^2 cohomology for iterated fibred cusp metrics on the smooth stratum. In particular given a Witt space, we identify the L2L^2 cohomology of iterated fibred cusp metrics with the middle perversity i…

2012-06-05abs ↗pdf ↗

In this paper we consider a problem of searching a space of predictive models for a given training data set. We propose an iterative procedure for deriving a sequence of improving models and a corresponding sequence of sets of non-linear features on the original input space. After a finite number of iterations N, the n…

2013-12-19abs ↗pdf ↗

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.

Algebraic knots are known to be iterated torus knots and to admit L-space surgeries. However, Hedden proved that there are iterated torus knots that admit L-space surgeries but are not algebraic. We present an infinite family of such examples, with the additional property that no nontrivial linear combination of knots …

2016-03-29abs ↗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 ↗

Improved stochastic Halpern iteration for fixed-point approximation in normed spaces.

problem Approximating fixed-points of nonexpansive and contractive operators in normed finite-dimensional spaces.
method Stochastic Halpern iteration with minibatch, analyzing oracle complexity.
result Improved oracle complexity for nonexpansive operators, with a lower bound of Ω(ε3)Ω(\varepsilon^{-3}).

The study analyzes how stochastic recursive algorithms converge to Markov chains.

problem Understanding convergence of stochastic recursive algorithms to Markov chains.
method Analyzes iterated random operators and contraction operators over Polish spaces.
result The distribution of random sequences converges to the invariant distribution of the Markov chain.

XLVINs improve data efficiency in implicit planning by leveraging latent space.

problem Improving data efficiency in implicit planning algorithms.
method XLVINs use a high-dimensional latent space to perform planning computations, breaking the algorithmic bottleneck.
result XLVINs significantly improve data efficiency across various settings compared to value iteration-based implicit planners and model-free baselines.

FHBI enhances generalization in Bayesian inference with iterative steps in functional spaces.

problem Improving generalization in Bayesian inference models.
method Iterative two-step procedure with adversarial and functional descent steps in a reproducing kernel Hilbert space.
result FHBI consistently outperforms nine baseline methods on the VTAB-1K benchmark.

We consider trivializations of second iterated bundles of a Lie group that preserve lifted group structures. With such a trivialization, we elaborate Hamiltonian dynamics on cotangent, Lagrangian dynamics on tangent bundles and, both Hamiltonian and Lagrangian dynamics on Tulczyjew's symplectic space which is tangent o…

2015-03-23abs ↗pdf ↗

Paper solves DRO for continuous distributions with iterative algorithms.

problem Distributionally robust optimization with continuous worst-case distributions.
method Iterative algorithm for global convergence, leveraging Brenier's theorem and JKO scheme.
result Achieves global convergence under mild assumptions for minimax problems.

This paper resolves equivariant K-theory for abelian actions.

problem Understanding equivariant K-theory for abelian group actions.
method Using iterated spaces and twisted deRham forms, the paper describes equivariant K-theory in terms of bundles over the base.
result A direct proof of the equivariant Atiyah-Hirzebruch isomorphism is provided.

Graph-based NAS improves sample efficiency in architecture design.

problem Current NAS search spaces are static sequences, limiting expressiveness.
method Proposed graph-based search space with vertices and edges for iterative and branching decisions.
result Graph representation improves sample efficiency in architecture design.

IBPF algorithm tackles high-dimensional parameter learning for complex systems.

problem Learning high-dimensional parameters in complex, partially observed, and nonlinear systems.
method Iterated Block Particle Filter (IBPF) for graphical state space models.
result IBPF algorithm consistently beats the curse of dimensionality across various experiments.

Bayesian optimization tackles unknown search spaces with automatic expansion.

problem Bayesian optimization in unknown search spaces is challenging.
method Proposes a systematic volume expansion strategy to find points close to the objective function maximum without specifying parameters.
result Derives analytic expressions for expansion triggers and sizes, achieving epsilon-accuracy after a finite number of iterations.

We construct a parallel transport on higher loop spaces of a manifold in term of a higher dimensional generalization of iterated path integrals. Under mild assumptions, we define a de Rham complex on higher loop spaces and we recover a known result of Hain of a de Rham structure on higher homotopy groups of a manifold.…

2012-06-25abs ↗pdf ↗

In a recent paper Donaldson defines three operators on a space of Hermitian metrics on a complex projective manifold: T,Tν,TK.T, T_ν, T_K. Iterations of these operators converge to balanced metrics, and these themselves approximate constant scalar curvature metrics. In this paper we investigate the convergence properties of …

2007-06-28abs ↗pdf ↗

We consider the problem of supervised learning with convex loss functions and propose a new form of iterative regularization based on the subgradient method. Unlike other regularization approaches, in iterative regularization no constraint or penalization is considered, and generalization is achieved by (early) stoppin…

2015-03-31abs ↗pdf ↗

In this paper we consider the dynamical system involved by the Ricci operator on the space of Kähler metrics. A. Nadel has defined an iteration scheme given by the Ricci operator for Fano manifold and asked whether it has some nontrivial periodic points. First, we prove that no such periodic points can exist. We define…

2007-09-10abs ↗pdf ↗

Faster WIND accelerates iterative BOND for LLM alignment.

problem Iterative BOND is inefficient in practice due to sample and computation inefficiency.
method Unified game-theoretic connection to self-play alignment, WIND framework with efficient algorithms.
result WIND variant achieves superior sample efficiency and faster computation.

Max-plus algebra approximates MDP value iteration for reduced state space.

problem Approximating optimal value function in high-dimensional MDPs.
method Uses max-plus algebra to represent value functions in a smaller dictionary, leading to an adaptive matching pursuit algorithm.
result Theoretical results show reduced complexity not tied to state space size, with empirical success on simple problems.

For the multiple differential algebra of iterated differential forms (see math.DG/0605113 and math.DG/0609287) on a diffiety (O,C) an analogue of C-spectral sequence is constructed. The first term of it is naturally interpreted as the algebra of secondary iterated differential forms on (O,C). This allows to develop sec…

2006-10-30abs ↗pdf ↗

Study shows long-term flow on special manifolds with positive Yamabe constant.

problem Analyzing long-time behavior of Yamabe flow on singular spaces.
method Formulated axioms for long-time existence, used parabolic Moser iteration for bounds.
result Established long-time existence of normalized Yamabe flow on specified manifolds.

Let X be a topological space. The homology of the iterated loop space HΩnXH_*Ω^n X is an algebra over the homology of the framed n-disks operad HfDnH_*f\mathcal{D}_n \cite{Getzler:BVAlg,Salvatore-Wahl:FrameddoBVa}. We determine completely this HfDnH_*f\mathcal{D}_n-algebra structure on H(ΩnX;Q)H_*(Ω^n X;\mathbb{Q}). We show that t…

2007-07-20abs ↗pdf ↗

ParK efficiently solves kernel ridge regression for large datasets.

problem Large-scale kernel ridge regression efficiency and accuracy.
method Partitioning feature space with random projections and iterative optimization.
result Provably maintains statistical accuracy with reduced space and time complexity.

In the preceding note math.DG/0610917 the Λk1CΛ_{k-1}\mathcal{C}--spectral sequence, whose first term is composed of \emph{secondary iterated differential forms}, was constructed for a generic diffiety. In this note the zero and first terms of this spectral sequence are explicitly computed for infinite jet spaces. In par…

2007-03-22abs ↗pdf ↗

Policy gradient methods with aggregated states can achieve better performance than approximate policy iteration.

problem Approximation errors in policy and value function approximations.
method State-aggregated representations and policy gradient methods.
result Policy gradient methods can achieve a per-period regret bounded by ε, while approximate policy iteration and value iteration have a higher regret.

Sharp gradient estimates for a weighted p-Laplacian equation on metric measure spaces.

problem Analyzing solutions to a specific weighted p-Laplacian equation.
method Applying Nash-Moser iteration to obtain sharp gradient estimates.
result Established Liouville theorems for the equation.

Study transforms discrete graph surfaces into smooth continua through iterative subdivision.

problem Abstracting a smooth continuum from a discrete graph surface.
method Iterative Goldberg-Coxeter subdivision method to converge discrete surfaces into a continuum.
result The limit set forms a continuum geometric object from the discrete surface.