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,341 papers · 148 categories

Trend · papers per month

4488132176 · Jun 202019922001200920182026
48 results for non-expansive maps

New analysis of stochastic approximation with non-expansive mappings.

problem Finite-time analysis of two-time-scale stochastic approximation with non-expansive mappings.
method Studied two-time-scale stochastic approximation algorithms with non-expansive mappings and projection steps.
result Last-iterate mean square residual error decays at a rate O(1/k1/4ε)O(1/k^{1/4-ε}).

The paper develops a new mathematical framework for group-equivariant operators in machine learning.

problem Developing a robust mathematical framework for group-equivariant operators in machine learning.
method The paper introduces group-equivariant non-expansive operators (GENEOs) and studies their topological and metric properties.
result The space of GENEOs is compact and convex, providing fundamental guarantees for machine learning.

The paper studies geometric properties of group equivariant operators and their Riemannian structure.

problem Understanding the geometric structure of group equivariant operators.
method Endowing the space of group equivariant non-expansive operators with a Riemannian manifold structure and using gradient descent methods.
result Gradient descent methods can be applied to minimize cost functions on the space of group equivariant non-expansive operators.

The paper extends metric space concepts from linear to non-linear settings.

problem Extension of linear concepts to metric spaces.
method Extension of symmetric orthogonality and non-expansive projections from linear to metric spaces, considering spaces with non-positive curvature.
result Equivalence of symmetric orthogonality and non-expansive projections in spaces with non-positive curvature.

Improved stochastic approximation method reduces residual error.

problem Reducing residual error in stochastic approximation algorithms.
method Fixed-schedule one-quarter barrier and bias-corrected acceleration.
result Achieves T1/2+o(1)T^{-1/2+o(1)} residual reduction with O(1)O(1) primitive samples.

Convergence of the Kalman filter is best analyzed by studying the contraction of the Riccati map in the space of positive definite (covariance) matrices. In this paper, we explore how this contraction property relates to a more fundamental non-expansiveness property of filtering maps in the space of probability distrib…

2015-03-31abs ↗pdf ↗

Paper defines mathematical framework for neural network explainability.

problem Neural network explainability and equivariant operators.
method Mathematical framework based on Group Equivariant Non-Expansive Operators (GENEOs) and complexity measures.
result Formal properties and interpretability of Group Equivariant Operators (GEOs) defined.

New method recovers signals from compressed measurements using generative networks with contractive layers.

problem Signal recovery from compressed measurements with generative network priors.
method Developed a new matrix concentration inequality (R2WDC) to relax expansivity conditions for generative networks.
result Signals in the range of a Gaussian generative network can be recovered from few linear measurements with contractive layers.

A single-vertex origami is a piece of paper with straight-line rays called creases emanating from a fold vertex placed in its interior or on its boundary. The Single-Vertex Origami Flattening problem asks whether it is always possible to reconfigure the creased paper from any configuration compatible with the metric, t…

2010-03-17abs ↗pdf ↗

Proposes a topological model for partial equivariance in neural networks.

problem Capturing partial equivariance in neural networks for data analysis.
method Introduces P-GENEOs and studies spaces of measurements and P-GENEOs between them.
result Spaces of measurements and P-GENEOs have convenient approximation and convexity properties.

Maximal concentration bounds for stochastic approximation with heavy-tailed noise.

problem Analyzing the convergence of stochastic approximation algorithms under heavy-tailed Markovian noise.
method Novel Lyapunov function and black-box truncation argument.
result Tail behavior of the error can be sub-Gaussian, sub-Weibull, or lighter than any Pareto but heavier than any Weibull.

This work uses sampling theory to analyze smoothness and error bounds of finite neural networks.

problem Analyzing the function space of finite neural networks and providing error bounds.
method Applying sampling theory to finite neural networks with non-expansive activation functions, considering both deterministic and random sampling.
result Novel error bounds for univariate neural networks under band-limited input assumption, highlighting the advantage of deterministic uniform sampling.

Framework for designing nonlinearities in neural networks with slope constraints.

problem Designing nonlinearities with specific properties for signal processing.
method Variational framework with regularization for slope constraints and optimization of adaptive splines.
result Adaptive nonuniform linear splines achieve global optimum in constrained optimization.

SCENE-Net improves 3D point cloud segmentation with low resource usage and transparency.

problem Lack of resources and transparency in 3D semantic segmentation models.
method SCENE-Net uses signature shapes identified via GENEOs to achieve semantic segmentation with minimal resources.
result SCENE-Net achieves comparable IoU to state-of-the-art methods with less data and computational resources.

Novel algorithm accelerates PnP methods for image deblurring and super-resolution.

problem Efficiently solving inverse problems and imaging with provable convergence guarantees.
method Incorporates quasi-Newton steps into provable PnP framework based on proximal denoisers.
result 2--8x faster convergence compared to other provable PnP methods with similar quality.

CCDF reduces diffusion sampling steps for inverse problems.

problem Slow sampling from diffusion models in inverse problems.
method Starting from a single forward diffusion step with better initialization, followed by stochastic contraction.
result Significantly reduced sampling steps for state-of-the-art reconstruction.

NAST generalizes scattering transform for non-stationary time series analysis.

problem Analyzing non-stationary time series data.
method Neural activation of scattering transform with various activation functions and high pass filters.
result Central and non-central limit theorems for NAST of Gaussian processes.

This work extends GNNs to handle multiple graphs with non-commuting operators, proving transferability.

problem Handling multiple graphs with non-commuting operators in graph neural networks.
method Developed a mathematical theory for graph-tuple neural networks (GtNNs) with non-commuting non-expansive operators.
result Proved universal transferability of GtNNs, ensuring no non-transferable energy under convergence.

We develop algorithms to learn non-linear dynamical systems without mixing assumptions.

problem Learning non-linear dynamical systems from dependent data.
method We introduce an offline algorithm and a one-pass streaming method with SGD-RER.
result Our methods achieve optimal or near-optimal performance for learning non-linear systems.

Both bi-harmonic map and ff-harmonic map have nice physical motivation and applications. In this paper, by combination of these two harmonic maps, we introduce and study ff-bi-harmonic maps as the critical points of the ff-bi-energy functional 12Mfτ(φ)2dvg\frac{1}{2}\int_M f|τ(φ)|^2dv_{g}. This class of maps generalizes both …

2013-05-23abs ↗pdf ↗

The paper generalizes Reeb spaces for special generic maps and lifts smooth functions.

problem Constructing lifts of smooth maps, especially Morse functions.
method Defining and generalizing quotient maps onto Reeb spaces of special generic maps and constructing lifts.
result Lifts of Morse functions can be constructed using the generalized maps.

Research explores real algebraic realization of round fold maps of codimension -1.

problem Real algebraic realization of round fold maps of codimension -1.
method Generalizes canonical projections of unit spheres to round fold maps and discusses their real algebraic realization.
result Developed new studies in real algebraic geometry focusing on round fold maps of codimension -1.

Study shows pure mapping classes can generate pseudo-Anosov mapping classes with certain conditions.

problem Understanding when pure mapping classes generate pseudo-Anosov mapping classes.
method Analyzing products of a given mapping class and powers of pure mapping classes, deriving an explicit constant.
result Almost all pure mapping classes generate pseudo-Anosov mapping classes when their powers exceed a certain constant.

The paper derives Liouville theorems for various generalized maps on Riemannian manifolds.

problem Deriving Liouville theorems for generalized maps on Riemannian manifolds.
method Using conservation laws and monotonicity formulas, the paper derives Liouville theorems for different types of maps under various conditions.
result The paper establishes Liouville theorems for several types of generalized maps, including φφ-FF harmonic maps, φφ-FF symphonic maps, and φφ-FF-VV-harmonic maps.

Study of liftable mapping class group for superelliptic covers.

problem Understanding mapping class groups of superelliptic covers.
method Computational and algebraic methods to study the liftable mapping class group.
result The liftable mapping class group is independent of the degree of the cover and has finite abelianization.

The paper explores unique continuation properties for polyharmonic maps between Riemannian manifolds.

problem Investigating unique continuation principles for polyharmonic maps.
method Analyzing critical points of higher order functionals to prove extensions of known results in harmonic and biharmonic cases.
result Proving extensions of unique continuation principles for k-harmonic maps.

This paper constructs real algebraic maps that are topologically special generic maps.

problem Constructing smooth maps in differential topology and real algebraic geometry.
method Constructs real algebraic maps that are topologically special generic maps.
result Real algebraic maps are topologically special generic maps.

Characterizes a general range decreasing group homomorphism.

problem Understanding range decreasing group homomorphisms in the entire mapping group.
method Characterization of a general range decreasing group homomorphism.
result Computes a particular class of homomorphisms and identifies all range decreasing group homomorphisms on specific mapping groups.

The paper proves a Liouville theorem for specific harmonic maps with free boundary.

problem Analyzing harmonic maps with free boundary conditions.
method Developed Liouville theorem for φ φ-FF-symphonic, φ φ-FF-harmonic, and φ φ-ΦS,p,εΦ_{S, p, \varepsilon} harmonic maps.
result Established Liouville theorem for the specified harmonic maps with free boundary.