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

5101419 · May 202619922001200920172026
48 results for transversal unfoldings

Study families of Lie algebroids on complex spaces, introducing unfoldings.

problem Investigate singular holomorphic Lie algebroids on complex analytic spaces.
method Introduce and study unfoldings of Lie algebroids, showing a correspondence with holomorphic flat connections.
result Existence of a one-to-one correspondence between transversal unfoldings and holomorphic flat connections.

We relate ergodic-theoretic properties of a very small tree or lamination to the behavior of folding and unfolding paths in Outer space that approximate it, and we obtain a criterion for unique ergodicity in both cases. Our main result is that non-unique ergodicity gives rise to a transverse decomposition of the foldin…

2014-10-31abs ↗pdf ↗

New method for unbinned, profiled unfolding in particle physics.

problem Traditional unfolding methods are limited in the number of unfolded variables and cannot profile nuisance parameters.
method Proposes a machine learning-based method that allows for unbinned differential cross sections and profiles nuisance parameters.
result Demonstrates the method with Gaussian examples and a simulated Higgs boson cross section measurement.

Study on unfolding maps of surfaces in 3D space, proving versality conditions.

problem Investigating the versality of rotation unfolding of folding maps for surfaces in R3\mathbb{R}^3.
method Introducing and analyzing the rotation unfolding of folding maps, proving versality conditions in terms of geometry.
result Proved conditions for the rotation unfolding to be versal, showing diffeomorphic type of tangent plane locus.

The paper studies phase transitions in random matrices and tensor unfolding for detecting signals.

problem Phase transitions in singular values and vectors of large random matrices.
method Analysis of singular values and vectors of long rectangular random matrices, and tensor unfolding algorithm for asymmetric rank-one spiked tensor models.
result An exact threshold for tensor unfolding to detect signals, independent of unfolding procedure.

Collider data must be corrected for detector effects ("unfolded") to be compared with many theoretical calculations and measurements from other experiments. Unfolding is traditionally done for individual, binned observables without including all information relevant for characterizing the detector response. We introduc…

2019-11-20abs ↗pdf ↗

We show that every convex polyhedron admits a simple edge unfolding after an affine transformation. In particular there exists no combinatorial obstruction to a positive resolution of Durer's unfoldability problem, which answers a question of Croft, Falconer, and Guy. Among other techniques, the proof employs a topolog…

2013-05-14abs ↗pdf ↗

A simple self-supervised model for tensor RPCA using deep unfolding.

problem Tensor robust principal component analysis (RPCA) challenges in practical applications.
method Deep unfolding with only four hyperparameters.
result Competitive or superior performance compared to supervised methods, even in data-starved scenarios.

A new machine learning method handles nuisance parameters for better unfolding in particle physics.

problem Improving statistical correction of cross sections in complex particle physics detectors.
method Profile OmniFold, a machine learning-based Expectation-Maximization procedure that incorporates nuisance parameters.
result Demonstrated the effectiveness of Profile OmniFold on both simulated and real data.

In a previous work we proved the uniqueness and functoriality of primary unfoldings on simple Thom-Mather spaces, which is a functor to the category of smooth manifolds. In this article we extend these results for any stratified Thom-Mather pseudomanifold with arbitary finite length, through a new kind of intermediate …

2009-10-04abs ↗pdf ↗

A pseudo-edge graph of a convex polyhedron K is a 3-connected embedded graph in K whose vertices coincide with those of K, whose edges are distance minimizing geodesics, and whose faces are convex. We construct a convex polyhedron K in Euclidean 3-space with a pseudo-edge graph with respect to which K is not unfoldable…

2017-09-14abs ↗pdf ↗

This is mainly a survey article on the recent development of the theory of graph-like Legendrian unfoldings and its applications. The notion of big Legendrian submanifolds was introduced by Zakalyukin for describing the wave front propagations. Graph-like Legendrian unfoldings belong to a special class of big Legendria…

2014-10-31abs ↗pdf ↗

Unified framework for spectral methods, kernel learning, and manifold unfolding.

problem Tackles the unification and optimization of spectral dimensionality reduction methods.
method Unified spectral methods as kernel PCA, kernel learning by SDP, and detailed explanation of MVU variants.
result Unified understanding and optimization of manifold learning techniques.

Deep unfolding accelerates MCMC-based COP solvers.

problem Optimizing combinatorial problems with MCMC and gradient descent.
method Combines MCMC and gradient descent, trains step sizes, uses variance estimation for non-differentiable MCMC.
result Significantly accelerates convergence speed for COPs.

Chebyshev steps improve convergence in deep-unfolded gradient descent.

problem Improving convergence speed in iterative algorithms.
method Introducing Chebyshev steps to bound convergence rate of gradient descent.
result Chebyshev steps lead to asymptotically optimal convergence rate.

In this paper, we introduce the notions of map-germs of pedal unfolding type and normalized Legendrian map-germs; and then we show that the fundamental theorem of calculus provides a natural one to one correspondence between Whitney umbrellas of pedal unfolding type and normalized swallowtails.

2011-12-21abs ↗pdf ↗

ULES embeds dynamic networks with stability guarantees.

problem Stability of time-varying node embeddings in evolving networks.
method Unfolded Laplacian Spectral Embedding (ULSE) using normalized Laplacian operators.
result ULES satisfies cross-sectional and longitudinal stability under dynamic stochastic block model.

Branched covers are applied frequently in topology - most prominently in the construction of closed oriented PL d-manifolds. In particular, strong bounds for the number of sheets and the topology of the branching set are known for dimension d<=4. On the other hand, Izmestiev and Joswig described how to obtain a simplic…

2007-07-10abs ↗pdf ↗

Maximum Variance Unfolding is one of the main methods for (nonlinear) dimensionality reduction. We study its large sample limit, providing specific rates of convergence under standard assumptions. We find that it is consistent when the underlying submanifold is isometric to a convex subset, and we provide some simple e…

2012-08-31abs ↗pdf ↗

New method uses Wasserstein loss for data unfolding, offering better accuracy than classical techniques.

problem Removing noise or artifacts from measurements in physics experiments.
method Alternative formulation using Wasserstein loss, developing a convergent algorithm.
result Optimal transport approach offers robust, accurate performance compared to classical techniques, especially in cases with significant binning artifacts.

A procedure for unfolding the true distribution from experimental data is presented. Machine learning methods are applied for simultaneous identification of an apparatus function and solving of an inverse problem. A priori information about the true distribution from theory or previous experiments is used for Monte-Car…

2010-04-12abs ↗pdf ↗

This paper develops a novel deep recurrent neural network for sequential signal reconstruction.

problem Sequential signal reconstruction from low-dimensional measurements.
method Unfolding a reweighted 1\ell_1-1\ell_1 minimization algorithm to design a deep recurrent neural network.
result The proposed reweighted-RNN significantly outperforms existing RNN models in sequential frame reconstruction.

A new method for unfolding histograms without matrix inversion.

problem Matrix inversion in experimental physics, especially in high-energy particle physics.
method Sampling many distributions, folding them through the response matrix, and choosing the closest one to the data.
result Performs as well as traditional methods in well-defined inverse problems and outperforms them in ill-defined ones.

A very simple heuristic approach to the unfolding problem will be described. An iterative algorithm starts with an empty histogram and every iteration aims to add one entry to this histogram. The entry to be added is selected according to a criteria which includes a χ2χ^2 test and a regularization. After a relatively s…

2014-10-17abs ↗pdf ↗

This article is devoted to the study of smooth desingularization, which are customary employed in the definition of De Rham Intersection Cohomology with differential forms. In this paper we work with the category of Thom-Mather simple spaces. We construct a functor which sends each Thom-Mather simple space into a smoot…

2008-06-02abs ↗pdf ↗

Sparse coding is typically solved by iterative optimization techniques, such as the Iterative Shrinkage-Thresholding Algorithm (ISTA). Unfolding and learning weights of ISTA using neural networks is a practical way to accelerate estimation. In this paper, we study the selection of adapted step sizes for ISTA. We show t…

2019-05-27abs ↗pdf ↗

We introduce the notion of reticular Legendrian unfoldings in order to investigate stabilities of bifurcations of wavefronts generated by a hypersurface germ with a boundary, a corner, or an r-corner in a smooth n dimensional manifold. We define several stabilities of reticular Legendrian unfoldings and prove that they…

2009-09-29abs ↗pdf ↗

The paper proves ideal triangulations and disk unfolding for singular flat surfaces.

problem Proving ideal triangulations and disk unfolding for singular flat surfaces.
method Using geodesic triangulation and finite geodesic connections.
result Each singular flat surface has an ideal triangulation and can be unfolded into a flat disk.

Study flat metrics from right prisms, finding non-lattice surfaces with translation coverings.

problem Analyzing flat metrics from right regular prisms.
method Viewing prisms as n-differentials and analyzing unfoldings, proving translation coverings to hyperelliptic surfaces.
result Non-lattice surfaces admit translation coverings to hyperelliptic surfaces, allowing explicit computation of orbit closures and counting problems.

State-free reversible VAMPnets (SRVs) are a neural network-based framework capable of learning the leading eigenfunctions of the transfer operator of a dynamical system from trajectory data. In molecular dynamics simulations, these data-driven collective variables (CVs) capture the slowest modes of the dynamics and are…

2019-06-12abs ↗pdf ↗

We study the intrinsic geometry of area minimizing (and also of almost minimizing) hypersurfaces from a new point of view by relating this subject to quasiconformal geometry. For any such hypersurface we define and construct a so-called S-structure which reveals some unexpected geometric and analytic properties of the …

2018-05-06abs ↗pdf ↗

The paper generalizes envelope constructions for chords in circles, revealing complex singularities.

problem Understanding envelopes of chords in circles with varying parameters and configurations.
method Generalizing the embroidery method to rational and concentric circles, breaking symmetry to reveal higher singularities.
result Higher singularities like swallowtails and butterflies can be unfolded, revealing their structure.

Study the geometry of bifurcation sets for specific types of functions.

problem Understanding the structure of bifurcation sets for specific types of functions.
method Using blow-ups and parametrization, investigate the Gaussian curvature, principal curvatures, and curve behavior.
result Bifurcation sets of D4±D_4^\pm-functions can be parametrized as surfaces in R3R^3.

Proposes a novel neural architecture for sparse coding using learned greedy pursuit.

problem Lack of interpretability in neural network architectures for sparse coding.
method Unfolded and learned version of Orthogonal Matching Pursuit (OMP) algorithm.
result Demonstrates flexibility and efficiency of the Learned Greedy Method (LGM) in various experiments.