We construct bi-invariant total orderings of residually torsion-free nilpotent groups by using Chen's iterated integrals. This construction can be seen as a generalization of the Magnus ordering of the free groups, and equivalent to the classical construction which uses an iteration of central extensions. Our geometric…
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
48 results for “iterative construction”
Smooth SE structures on Sasaki-joins and Bott orbifolds constructed.
problem Constructing smooth Sasaki-Einstein structures on Sasaki-joins.
method Categorical relationship between Sasaki-joins and Bott orbifolds, explicit construction.
result Infinitely many smooth SE structures up to dimension eleven, conjecture for all odd dimensions.
Paper constructs hyperbolic Coxeter groups that virtually fiber over Z.
problem Creating hyperbolic Coxeter groups that virtually fiber.
method Iterative procedure combining Jankiewicz-Norin-Wise results and Osajda's construction.
result Proves construction of groups with increasing vcd with each iteration.
Extends construction of Kähler-Einstein metrics to noncompact manifolds.
problem Construct complete Kähler-Einstein metrics on noncompact manifolds.
method Iterative construction using Berndtsson's method.
result Induces semipositively curved metric on relative canonical bundle.
We construct 2-dimensional CAT(-1) groups which contain free subgroups with arbitrary iterated exponential distortion, and with distortion higher than any iterated exponential.
Recurrent iterated function systems (RIFSs) are improvements of iterated function systems (IFSs) using elements of the theory of Marcovian stochastic processes which can produce more natural looking images. We construct new RIFSs consisting substantially of a vertical contraction factor function and nonlinear transform…
New method for curve comparison using iterated integrals and moving frames.
problem Comparing curves robustly to noise and transformations.
method Moving frame method paired with log-signature transform.
result Algorithmic construction of invariants for curve equivalence under rigid motions.
Real-Smooth Hypersurfaces in math.CV
Formal normal form created for real-smooth hypersurfaces.
problem Real-smooth hypersurfaces in complex spaces.
method Iterative normalization procedure.
result Formal normal form constructed for a large class of hypersurfaces.
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.
For a genus-1 1-bridge knot in the 3-sphere, that is, a (1,1)-knot, a middle tunnel is a tunnel that is not an upper or lower tunnel for some (1,1)-position. Most torus knots have a middle tunnel, and non-torus-knot examples were obtained by Goda, Hayashi, and Ishihara. In a previous paper, we generalized their constru…
Iterative method finds Hermitian-Einstein metrics on stable bundles.
problem Finding Hermitian-Einstein metrics on stable bundles over Kähler or Gauduchon manifolds.
method Iterative construction using a specific metric update formula.
result Smooth convergence to a Hermitian-Einstein metric from any initial metric.
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.
Pre-conditioning is a well-known concept that can significantly improve the convergence of optimization algorithms. For noise-free problems, where good pre-conditioners are not known a priori, iterative linear algebra methods offer one way to efficiently construct them. For the stochastic optimization problems that dom…
The paper constructs CR manifolds with arbitrary Levi nondegeneracy.
problem Creating CR manifolds with specific Levi nondegeneracy properties.
method Using algebras from representations, studying iterated Levi forms, and local model equations.
result Explicit construction and analysis of homogeneous CR manifolds with arbitrary Levi nondegeneracy.
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 …
Policy iteration is a family of algorithms that are used to find an optimal policy for a given Markov Decision Problem (MDP). Simple Policy iteration (SPI) is a type of policy iteration where the strategy is to change the policy at exactly one improvable state at every step. Melekopoglou and Condon [1990] showed an exp…
Support vector machines (SVMs) are an important tool in modern data analysis. Traditionally, support vector machines have been fitted via quadratic programming, either using purpose-built or off-the-shelf algorithms. We present an alternative approach to SVM fitting via the majorization--minimization (MM) paradigm. Alg…
Private Learning of Halfspaces: Simplifying the Construction and Reducing the Sample Complexitycs.LG
Improved private learning of halfspaces with reduced sample complexity.
problem Private learning of halfspaces with reduced sample complexity.
method Iterative algorithm for solving linear feasibility problem, improving state-of-the-art results.
result Sample complexity reduced to , improving factor.
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…
A theorem of Furuta and Fintushel-Stern provides a criterion for a collection of Seifert fibred homology spheres to be independent in the homology cobordism group of oriented homology 3-spheres. In this article we use these results and some 4-dimensional constructions to produce infinite families of positive torus knot…
Constructs supermartingale couplings with full marginals constraints.
problem Optimal transport for supermartingale couplings with multiple marginals.
method Markovian iteration of one-period optimal supermartingale couplings.
result Explicit construction of supermartingale processes solving optimal transport problem.
While deep neural networks have proven to be a powerful tool for many recognition and classification tasks, their stability properties are still not well understood. In the past, image classifiers have been shown to be vulnerable to so-called adversarial attacks, which are created by additively perturbing the correctly…
Study of higher-dimensional contact manifolds and their properties.
problem Understanding contact manifolds in higher dimensions.
method Topological and symplectic methods, including open books.
result Many contact manifolds can be realized as iterated planar contact manifolds.
Coherent uncertainty quantification is a key strength of Bayesian methods. But modern algorithms for approximate Bayesian posterior inference often sacrifice accurate posterior uncertainty estimation in the pursuit of scalability. This work shows that previous Bayesian coreset construction algorithms---which build a sm…
A method to construct fractal surfaces by recurrent fractal curves is provided. First we construct fractal interpolation curves using a recurrent iterated functions system(RIFS) with function scaling factors and estimate their box-counting dimension. Then we present a method of construction of wider class of fractal su…
Compact metric f-K-contact manifolds constructed via specific transformations.
problem Constructing all metric f-K-contact manifolds.
method Iteration of constructions of mapping tori, rotations, and type II deformations.
result Compact metric f-K-contact manifolds are derived from compact K-contact manifolds.
We give a new geometric obstruction to the iterated Bing double of a knot being a slice link: for n>1 the (n+1)-st iterated Bing double of a knot is rationally slice if and only if the n-th iterated Bing double of the knot is rationally slice. The main technique of the proof is a covering link construction simplifying …
Algorithm recovers causal graphs from data with fewer tests.
problem Recovering causal graphs from observational data with latent confounders and selection bias.
method Iterative CI tests with increasing condition set sizes.
result Significantly fewer CI tests and condition sets compared to FCI.
We study iterations of two classical constructions, the evolutes and involutes of plane curves, and we describe the limiting behavior of both constructions on a class of smooth curves with singularities given by their support functions. Next we study two kinds of discretizations of these constructions: the curves are r…
A Rigorous Construction of the Supersymmetric Path Integral Associated to a Compact Spin Manifoldmath.DG
We give a rigorous construction of the path integral in N=1/2 supersymmetry as an integral map for differential forms on the loop space of a compact spin manifold. It is defined on the space of differential forms which can be represented by extended iterated integrals in the sense of Chen and Getzler-Jones-Petrack. Via…
New iterative regularization method tackles non-smooth, non-strongly convex functionals.
problem Tackles non-smooth, non-strongly convex functionals in regularization problems.
method Primal-dual algorithm with convergence and stability analysis.
result First iterative regularization procedure for non-smooth, non-strongly convex functionals.
We show that on Kahler manifolds with negative first Chern class, the sequence of algebraic metrics introduced by H. Tsuji converges uniformly to the Kahler-Einstein metric. For algebraic surfaces of general type and orbifolds with isolated singularities, we prove a convergence result for a modified version of Tsuji's …
We provide an online RLHF workflow for large language models.
problem Lack of online RLHF workflow for large language models.
method Construct preference models using open-source datasets, approximate human feedback, and implement online iterative RLHF.
result Our LLM achieves state-of-the-art performance on various benchmarks.
Iterative Machine Teachingstat.ML
In this paper, we consider the problem of machine teaching, the inverse problem of machine learning. Different from traditional machine teaching which views the learners as batch algorithms, we study a new paradigm where the learner uses an iterative algorithm and a teacher can feed examples sequentially and intelligen…
Parsimonious representations are ubiquitous in modeling and processing information. Motivated by the recent Multi-Layer Convolutional Sparse Coding (ML-CSC) model, we herein generalize the traditional Basis Pursuit problem to a multi-layer setting, introducing similar sparse enforcing penalties at different representat…
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.…
We give an explicit construction of linearly independent families of knots arbitrarily deep in the (n)-solvable filtration of the knot concordance group using the ρ^1-invariant. A difference between previous constructions of infinite rank subgroups in the concordance group and ours is that the deepest infecting knots i…
Moving Target Monte Carlostat.CO
New algorithm MTMC reduces MCMC evaluation costs.
problem High-dimensional sampling with intractable posterior evaluations.
method Iteratively updated approximation of posterior distribution for acceptance rate.
result Approximation converges to true posterior as iterations increase.
We extend the construction of the DAHA-Jones polynomials for any reduced root systems and DAHA-superpolynomials in type A from the iterated torus knots (our previous paper) to links, including arbitrary algebraic links. Such a passage essentially corresponds to the usage of the products of Macdonald polynomials and is …
Beyond De Prado and Cotton: Hierarchical and Iterative Methods for General Mean-Variance Portfoliosq-fin.PM
New methods incorporate alpha signals into portfolio construction, improving performance.
problem Signal-blindness in existing portfolio construction methods.
method Introduces three methods: HRP-, HRP-, and CRISP.
result CRISP at intermediate consistently outperforms other methods.
Proves existence of at least two minimal spheres in any 3D space.
problem Existence of minimal spheres in arbitrary 3D spaces.
method Iterative relative min-max constructions.
result Proves existence of at least two embedded minimal spheres.
A remark on coveringmath.MG
We discuss construction of coverings of the unit ball of a finite dimensional Banach space. The well known technique of comparing volumes gives upper and lower bounds on covering numbers. This technique does not provide a construction of good coverings. Here we apply incoherent dictionaries for construction of good cov…
Paper proposes a new method to solve Schrödinger Bridge Problem using kernel regression.
problem Schrödinger Bridge Problem in the context of entropic optimal transport.
method Forward-reverse iterative Monte Carlo procedure using kernel regression.
result Developed a provably convergent algorithm for approximating Schrödinger potentials.
We show that there can be no algorithm to decide whether infinite recursively described acyclic aspherical 2-complexes are contractible. We construct such a complex that is contractible if and only if the Collatz conjecture holds.
We consider variants of trust-region and cubic regularization methods for non-convex optimization, in which the Hessian matrix is approximated. Under mild conditions on the inexact Hessian, and using approximate solution of the corresponding sub-problems, we provide iteration complexity to achieve -approximate seco…
While neural networks have achieved vastly enhanced performance over traditional iterative methods in many cases, they are generally empirically designed and the underlying structures are difficult to interpret. The algorithm unrolling approach has helped connect iterative algorithms to neural network architectures. Ho…
A spiral unibike track emerges from a mathematical construction.
problem Finding a unibike curve with a spiral shape.
method Starting with a polar square root curve, iteratively applying a differential equation to create a spiral unibike track.
result A spiral unibike curve is found with a precision error less than 10^-7.
New examples of extremal Kähler metrics on blow-ups of parabolic ruled surfaces are constructed. The method is based on the gluing construction of Arezzo, Pacard and Singer. This enables to endow ruled surfaces of the form with special parabolic structures such that the associated iter…