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% · Feb 199419922001200920182026
48 results for single smoothing

Smooth Schrödinger Bridges improve trajectory inference by smoothing Gaussian processes.

problem Improving trajectory inference in applications like particle tracking.
method Generalizes Schrödinger Bridge problem to smooth Gaussian processes, solving the problem on phase space.
result The method outperforms existing methods on real datasets.

NESS improves neighbor embedding for smooth cell-state transitions in single-cell data.

problem Challenges in extracting smooth, low-dimensional representations from noisy single-cell data.
method Builds on PCS framework to develop NESS, a stable machine learning approach.
result NESS consistently yields useful biological insights across diverse single-cell datasets.

TKFT models computation via smooth vector fields, simulating functions in a single dynamical step.

problem Modeling computation in a single step.
method Established Topological Kleene Field Theory (TKFT) as a new model of computation.
result Any computable function can be simulated in a single go of a dynamical system.

Improved SGD learning for single index models reduces sample complexity.

problem Learning a single index model with optimal sample complexity.
method Using smoothed loss in online SGD to reduce sample complexity.
result Online SGD with smoothed loss achieves optimal sample complexity of dk/2d^{k^\star/2}.

By studying the example of smooth structures on CP^2#3(-CP^2) we illustrate how surgery on a single embedded nullhomologous torus can be utilized to change the symplectic structure, the Seiberg-Witten invariant, and hence the smooth structure on a 4-manifold.

2011-11-18abs ↗pdf ↗

Two single-timescale algorithms improve TD learning with nonlinear approximations.

problem Optimizing TD learning with nonlinear smooth function approximation.
method Proposes two single-timescale single-loop algorithms with momentum and variance reduction.
result Achieves O(ε4)O(\varepsilon^{-4}) sample complexity for the first algorithm and O(ε3)O(\varepsilon^{-3}) for the second.

For each composite number n2kn\ne 2^k, there does not exist a single connected closed (n+1)(n+1)-manifold such that any smooth, simply-connected, closed nn-manifold can be topologically flat embedded into it. There is a single connected closed 5-manifold WW such that any simply-connected, 4-manifold MM can be topologica…

2005-09-24abs ↗pdf ↗

Many problems on signal processing reduce to nonparametric function estimation. We propose a new methodology, piecewise convex fitting (PCF), and give a two-stage adaptive estimate. In the first stage, the number and location of the change points is estimated using strong smoothing. In the second stage, a constrained s…

2018-03-14abs ↗pdf ↗

The paper explores the identifiability and interpretability of Gaussian process models using different kernel structures.

problem Identifiability and interpretability issues in Gaussian process models.
method The paper examines both single-output and multi-output Gaussian process models using additive and multiplicative mixtures of Matérn kernels.
result The smoothness of a mixture of Matérn kernels is determined by the least smooth component, and none of the mixing weights or parameters are identifiable.

New algorithms reduce complexity for solving nonconvex optimization problems with stochastic objectives and constraints.

problem Solving nonconvex optimization problems with stochastic objectives and constraints.
method Single-loop quadratic penalty and augmented Lagrangian algorithms with variance reduction techniques.
result Achieved best-known complexity guarantees for solving nonconvex optimization problems with stochastic objectives and constraints.

Orbits of families of vector fields on a subcartesian space are shown to be smooth manifolds. This allows for a global description of a smooth geometric structure on a family of manifolds in terms of a single object defined on the corresponding family of vector fields. Stratified spaces, Poisson spaces and almost compl…

2002-11-13abs ↗pdf ↗

Modified perturbation method removes non-smoothness in solving Black-Scholes equations.

problem Non-smoothness in solving Black-Scholes equations.
method Variable transformations and homotopy perturbation method.
result Excellent agreement with exact solutions for Black-Scholes and multi-asset options.

Proposes PSCs for UQ in deep nets without retraining.

problem Estimating uncertainty in deep nets with a single pass.
method Identifies sensitive, smooth intermediate layer, fits probabilistic model.
result PSCs achieve UQ and OOD detection performance matching existing methods.

The study analyzes convergence rates for sparse pivotal estimators in high-dimensional regression.

problem Sparse pivotal estimation in high-dimensional regression problems.
method Theoretical analysis and comparison of non-smooth + non-smooth optimization problems, including smoothing techniques.
result Minimax sup-norm convergence rates for square-root Lasso-type estimators are derived.

Single-timescale analysis improves convergence in multi-sequence stochastic approximation.

problem Finite-time convergence of nonlinear stochastic approximation with multiple coupled sequences.
method Smoothness property of fixed points and analysis of fine-grained single-timescale SA.
result Improved iteration complexity for achieving ε-accuracy in multi-sequence single-timescale SA.

ES-Single uses ES to estimate gradients in unrolled graphs, reducing variance and improving performance.

problem Estimating gradients in unrolled computation graphs with low variance and stability.
method Evolution strategies (ES) applied to unrolled graphs, with a single perturbation per particle.
result ES-Single reduces variance compared to PES, leading to better performance in various tasks.

Proves invertibility of layer potentials for generalized Stokes operators on smooth domains.

problem Invertibility of layer potentials for generalized Stokes operators on smooth domains.
method Developed algebra toolkit to handle layer operators' limit and jump relations; proved Fredholm property and invertibility.
result Proves invertibility of layer potentials for generalized Stokes operators on smooth domains.

Label smoothing improves generalization by controlling generalization loss.

problem Lack of mathematical understanding of label smoothing's effectiveness.
method Proposed a theoretical framework to show how label smoothing controls generalization loss in the label noise setting.
result Predicted an optimal label smoothing point that minimizes generalization loss.

VIND infers smooth nonlinear dynamics from electrophysiology data.

problem Analyzing smooth, nonlinear time series data from neuroscience experiments.
method Variational Inference for Nonlinear Dynamics (VIND) with structured approximate posterior and fixed-point iteration.
result VIND reconstructs 5D latent space variables similar to Hodgkin-Huxley models, and excels in predicting future neural activity.

This paper improves convergence guarantees for SGD algorithms in non-convex smooth functions.

problem Theoretical convergence properties of SGD algorithms for non-convex smooth functions.
method Analysis of SGD algorithms with arbitrary data ordering for non-convex smooth functions.
result Enhanced convergence guarantees for incremental gradient and single shuffle SGD, improving the optimization term of convergence guarantee.

Paper proposes a new method for sparse spectral clustering on Stiefel manifold.

problem Sparse spectral clustering on Stiefel manifold with nonsmooth and nonconvex objective.
method Proposes a manifold proximal linear method (ManPL) to solve the original SSC formulation.
result Demonstrates the advantage of ManPL over existing methods on single-cell RNA sequencing data.

New algorithm solves complex minimax problems efficiently.

problem Minimizing and maximizing bilinearly coupled smooth functions.
method Lifted Primal-Dual (LPD) method that optimally handles both smooth and bilinear terms.
result First optimal algorithm achieving the lower complexity bound for the problem.

New algorithm tackles stochastic bilevel optimization under relaxed smoothness conditions.

problem Optimal algorithms for stochastic bilevel optimization under relaxed smoothness conditions.
method Introduces a novel fully single-loop and Hessian-inversion-free algorithmic framework for stochastic bilevel optimization.
result Demonstrates state-of-the-art oracle complexity results for multi-objective robust bilevel optimization.

Single gradient step finds adversarial examples in random neural networks.

problem Finding adversarial examples in neural networks with random architectures.
method Gradient descent approach applied to random undercomplete and overcomplete two-layers neural networks.
result A single gradient step is sufficient to find adversarial examples in random neural networks.

Study on lens spaces bounding 4-manifolds with specific Betti numbers.

problem Which lens spaces can bound 4-manifolds with second Betti number one?
method Construction of specific 4-manifolds and analysis of lens space boundaries.
result Infinite families of lens spaces can bound 4-manifolds with second Betti number one, but not all.

Study shows how any group can be fundamental of a non-orientable 4-manifold with exotic structure.

problem Realizing any finitely presented group as the fundamental group of a non-orientable 4-manifold with exotic structure.
method Performing a Gluck twist to obtain an exotic smooth structure, and using 2-covers to stabilize the structure.
result Any finitely presented group can be realized as the fundamental group of a non-orientable 4-manifold with exotic structure.

New method improves robustness of large models without sacrificing accuracy.

problem Improving robustness of large pre-trained models without accuracy loss.
method Multi-scale diffusion denoised smoothing, selectively applying smoothing at multiple noise scales.
result Strong certified robustness at high noise levels with accuracy close to non-smoothed classifiers.

We propose a new proximal, path-following framework for a class of constrained convex problems. We consider settings where the nonlinear---and possibly non-smooth---objective part is endowed with a proximity operator, and the constraint set is equipped with a self-concordant barrier. Our approach relies on the followin…

2016-03-05abs ↗pdf ↗

Consider a smooth effective action of a torus Tn\mathbb{T}^n on a connected CC^{\infty}-manifold MM of dimension mm. Then nmn\leq m. In this work we show that if n<mn<m, then there exist a complete vector field XX on MM such that the automorphism group of XX equals TnR\mathbb T^n \otimes \mathbb{R}, where the facto…

2015-09-14abs ↗pdf ↗

Time series analysis is used to understand and predict dynamic processes, including evolving demands in business, weather, markets, and biological rhythms. Exponential smoothing is used in all these domains to obtain simple interpretable models of time series and to forecast future values. Despite its popularity, expon…

2017-06-09abs ↗pdf ↗

MARINA-P improves non-smooth federated optimization with adaptive stepsizes.

problem Non-smooth federated optimization in machine learning applications.
method Extends EF21-P and MARINA-P to non-smooth convex setting, proving optimal convergence rate and communication complexity bounds.
result MARINA-P achieves O(1/T)O(1/\sqrt{T}) convergence rate and communication complexity matching classical subgradient methods.

The study finds a special type of smooth function on connected sums of manifolds.

problem Finding smooth functions that are Morse on preimages of non-extrema values.
method Investigates internally Morse (I-Morse) and neat with respect to Reeb graph (N-Reeb) functions.
result Constructs an IN-Morse-Reeb function on a connected sum of given manifolds.

New algorithm for differentially private distributed optimization of smooth, non-convex problems.

problem No differentially private distributed method for smooth, non-convex optimization problems.
method Smoothed normalization integrated with an error-feedback mechanism.
result Achieves superior convergence rate and first differentially private distributed optimization algorithm with provable convergence guarantees.