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

85170254339 · Jun 202019922001200920172026
48 results for Discrete Regularization

Proves hardness of semi-discrete optimal transport and proposes regularization methods.

problem Computing Wasserstein distance between discrete and non-discrete probability measures.
method Proves hardness, introduces distributionally robust dual optimal transport, regularizes primal objective, uses stochastic gradient descent.
result Regularization schemes and improved convergence guarantees for semi-discrete optimal transport problems.

DRAG decreases regularization to accelerate semi-discrete OT convergence.

problem Mitigating bias in semi-discrete OT problems with entropic regularization.
method DRAG: Decreasing Regularization Averaged Gradient, a stochastic gradient descent algorithm.
result DRAG achieves unbiased O(1/t)\mathcal{O}(1/t) sample and iteration complexity for OT cost and potential estimation, and O(1/t)\mathcal{O}(1/\sqrt{t}) rate for OT map.

Study on Brownian motion on discrete curve spaces, proving stochastic completeness.

problem Analyzing Brownian motion on spaces of discrete curves.
method Introduced and studied Brownian motion on spaces of discrete regular curves with Sobolev-type metrics.
result All geodesically complete spaces of discrete regular curves are stochastically complete.

A fast method for discrete OT with group-sparse regularization for class label preservation.

problem Efficiently measuring the distance between two discrete distributions with class labels.
method Fast discrete OT with group-sparse regularizers using gradient-based algorithms.
result Up to 8.6 times faster than original method without degrading accuracy.

We study the set of critical exponents of discrete groups acting on regular trees. We prove that for every real number δδ between 00 and 12logq\frac{1}{2}\log q, there is a discrete subgroup ΓΓ acting without inversion on a (q+1)(q+1)-regular tree whose critical exponent is equal to δδ. Explicit construction of edge-index…

2018-07-04abs ↗pdf ↗

Generalized meshes for non-regular geometries, including fractures.

problem Discretization of partial differential equations in non-regular geometries.
method Introduces generalized meshes with overlapping elements and flexible adjacency relations.
result Discrete differential forms on virtually inflated meshes characterize the trace space of forms in surrounding volumes.

Universal inequalities for Laplacian eigenvalues on discrete groups.

problem Proving inequalities for Laplacian eigenvalues on discrete groups.
method Analyzing Laplacian eigenvalues with Dirichlet boundary conditions on subsets of discrete groups.
result Yang-type universal inequalities for Cayley graphs of amenable groups and the d-regular tree.

This paper uses the technology of weighted and regular triangulations to study discrete versions of the Laplacian on piecewise Euclidean manifolds. Regular triangulations are studied in some detail, including flip algorithms. The Laplacian is then studied as an operator on functions of the vertices as a generalized wei…

2005-08-10abs ↗pdf ↗

New algorithm improves OT map estimation for semi-discrete settings.

problem Improving estimation of OT maps in semi-discrete settings.
method Stochastic Gradient Descent with adaptive entropic regularization and averaging acceleration.
result Achieves nearly minimax rate of O(t1)\mathcal{O}(t^{-1}) for OT map estimation.

New wavelet frames constructed from reproducing kernels for continuous and discrete domains.

problem Generating wavelet frames on non-Euclidean structures.
method Spectral filtering of integral operators associated with reproducing kernels.
result Discrete frames as Monte Carlo estimates of continuous frames, with finite-sample rates derived.

This research proves that quadratic regularized optimal transport can approximate the Laplace-Beltrami operator on smooth manifolds.

problem Approximating the Laplace-Beltrami operator using optimal transport with quadratic regularization.
method Deriving first-order optimal potentials and analyzing the convergence of discrete Laplace operators.
result The discrete Laplace operators converge to the Laplace-Beltrami operator on smooth manifolds.

Paper tackles functional linear regression using spectral algorithms with discrete observations.

problem Functional linear regression problem with discretely observed data.
method Combines distributed spectral algorithms with Sobolev kernels for regularization.
result Derives matching upper and lower bounds for convergence in Sobolev norm.

We consider the entropic regularization of discretized optimal transport and propose to solve its optimality conditions via a logarithmic Newton iteration. We show a quadratic convergence rate and validate numerically that the method compares favorably with the more commonly used Sinkhorn--Knopp algorithm for small reg…

2017-10-18abs ↗pdf ↗

Examines discrete curvature's relation to smooth curvature in 3 spaces.

problem Understanding how discrete curvature relates to smooth curvature in different spaces.
method Using specific triangular tilings of 3 types of spaces to examine curvatures.
result Discrete curvature can sense the smooth curvature of ambient space forms.

Sharp Lipschitz bounds for flow-matching and diffusion models with optimal sampling rates.

problem Establishing optimal Lipschitz regularity for flow-matching and diffusion models.
method Sharp Lipschitz regularity theory for flow-matching vector fields and diffusion-model scores.
result Achieves optimal sampling rate of d/N\sqrt{d}/N for Euler-type samplers in dimension dd.

The study identifies all possible vector field structures on specific 2D shapes.

problem Optimal discrete gradient vector fields on surfaces with 1-2 critical cells.
method Analysis of discrete vector fields on 2D shapes with minimal critical cells.
result All possible structures of discrete Morse functions on specified shapes.

Proposes a variational approach to shallow neural networks, bypassing optimization.

problem Theoretical understanding and optimization of shallow neural networks.
method Replaces discrete training with a continuum variational surrogate, proving global well-posedness and regularity.
result Optimal parameter density can be obtained by solving a single linear system, achieving O(1/N)O(1/N) generalization error.

In a way similar to the continuous case formally, we define in different but equivalent manners the difference discrete connection and curvature on discrete vector bundle over the regular lattice as base space. We deal with the difference operators as the discrete counterparts of the derivatives based upon the differen…

2007-07-25abs ↗pdf ↗

Discrete Green's functions are the inverses or pseudo-inverses of combinatorial Laplacians. We present compact formulas for discrete Green's functions, in terms of the eigensystems of corresponding Laplacians, for products of regular graphs with or without boundary. Explicit formulas are derived for the cycle, torus, a…

2003-09-04abs ↗pdf ↗

We explore a new method for discrete-time control problems using randomization and entropy.

problem Discrete-time linear-exponential quadratic Gaussian (LEQG) control problem.
method Introduce exploration through randomization and apply duality between free energy and relative entropy.
result Reduced LEQG problem to equivalent risk-neutral LQG control problem with entropy regularization.

The paper proves convergence of discrete maps to Riemann mappings for polyhedral surfaces.

problem Discrete conformal geometry of polyhedral surfaces.
method Establishing rigidity for hexagonal triangulations and estimating quasiconformal constants.
result Discrete conformal maps converge to Riemann mappings for Jordan domains.

New method for discrete-time survival analysis with competing risks.

problem Discrete failure time data in survival analysis.
method Proposes a new estimation procedure for discrete-time survival analysis with competing events.
result Offers advantages over existing procedures and integrates regularized regression methods.

We investigate the relationship between a discrete version of thickness and its smooth counterpart. These discrete energies are defined on equilateral polygons with nn vertices. It will turn out that the smooth ropelength, which is the scale invariant quotient of length divided by thickness, is the ΓΓ-limit of the di…

2014-01-22abs ↗pdf ↗

A new method for learning function parameters in operators using data-adaptive RKHS.

problem Learning function parameters in operators with robustness to noise and numerical error.
method Data Adaptive RKHS Tikhonov Regularization (DARTR) method.
result DARTR leads to an accurate estimator robust to noise and numerical error, converging at a consistent rate as data refines.

In this paper we propose and study a family of continuous wavelets on general domains, and a corresponding stochastic discretization that we call Monte Carlo wavelets. First, using tools from the theory of reproducing kernel Hilbert spaces and associated integral operators, we define a family of continuous wavelets by …

2019-03-15abs ↗pdf ↗

Discrete Lagrange problems solved with Lie group constraints.

problem Solving discrete Lagrange problems with Lie group constraints.
method Proving critical sections are solutions of unconstrained variational problems, applying Noether theory and multisymplectic forms.
result Critical sections of discrete Lagrange problems are solutions of unconstrained variational problems.

We investigate a discrete version of the Möbius energy, that is of geometric interest in its own right and is defined on equilateral polygons with nn segments. We show that the ΓΓ-limit regarding LqL^{q} or W1,qW^{1,q} convergence, q[1,]q\in [1,\infty] of these energies as nn\to\infty is the smooth Möbius energy. This re…

2013-11-13abs ↗pdf ↗

This paper develops efficient bounds on the Wasserstein metric for discrete measures.

problem Computing the exact Wasserstein metric is computationally expensive.
method Formulates and solves a Kantorovich problem on a coarse grid using quantized measures and cost matrices, followed by upscaling and correction.
result Achieves a 10x-100x speedup while maintaining low approximation error.

In this paper, we study the discrete Morse flow for the Ricci flow on football, which is the 2-sphere with removed north and south poles and with the metric g0g_0 of constant scalar curvature, and and for Porous media equation on a bounded regular domain in the plane. We show that with a suitable assumption about $g(0)…

2012-03-10abs ↗pdf ↗

Paper establishes NE existence and efficient algorithms for weakly monotone GMFGs.

problem Existence and efficient learning of Nash Equilibrium in λλ-regularized GMFGs.
method Establishes existence of NE for any λλ-regularized GMFGs. Proposes efficient algorithms for weakly monotone GMFGs.
result Efficient algorithms for weakly monotone GMFGs with provable convergence.

We consider a geometrically finite discrete group of conformal transformations of the sphere. Further we consider distributions which are supported on the limit set and are invariant with conformal weight. We estimate their regularity in terms of the conformal weight, the Hausdorff dimension of the limit set, and the m…

2001-03-23abs ↗pdf ↗

Neural Ordinary Differential Equation (Neural ODE) has been proposed as a continuous approximation to the ResNet architecture. Some commonly used regularization mechanisms in discrete neural networks (e.g. dropout, Gaussian noise) are missing in current Neural ODE networks. In this paper, we propose a new continuous ne…

2019-06-05abs ↗pdf ↗

A new gradient flow for MMD with closed-form implementation.

problem Existing gradient flows either lack tractable numerical implementation or require strong assumptions.
method Introduces a (de)-regularized Maximum Mean Discrepancy (DrMMD) and its gradient flow.
result Guarantees near-global convergence for a broad class of targets in both continuous and discrete time.

New findings on optimal transport gradient for generative models, addressing numerical instabilities.

problem Numerical instabilities in training Wasserstein Generative Adversarial Networks (WGAN).
method Valid differentiation theorem for entropic regularized transport, semi-discrete gradient formulation, and optimization algorithm.
result Existence of optimal transport gradient for generative models under specified conditions.

Learning compact discrete representations of data is a key task on its own or for facilitating subsequent processing of data. In this paper we present a model that produces Discrete InfoMax Codes (DIMCO); we learn a probabilistic encoder that yields k-way d-dimensional codes associated with input data. Our model's lear…

2019-05-28abs ↗pdf ↗