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

Trend · papers per month

51101152202 · May 202619922001200920172026
48 results for cycle matching

This work introduces novel methods to identify and compare cycles across topological objects.

problem Identifying and comparing topological features, particularly cycles, across different topological objects.
method Two complementary approaches: dendrogram-based merge-tree algorithms and Stratified Gradient Sampling.
result Transformed cycle matching into hierarchical clustering and topological optimization framework.

This work proposes a new method to match distributions across different spaces using cycle-consistent maps.

problem Matching distributions across different spaces with consistent bidirectional maps.
method A novel unbalanced Monge optimal transport formulation for matching distributions on different spaces, employing cycle-consistent maps.
result The proposed discrepancy captures the cycle-consistent GAN framework and provides theoretical support.

The matching of multiple objects (e.g. shapes or images) is a fundamental problem in vision and graphics. In order to robustly handle ambiguities, noise and repetitive patterns in challenging real-world settings, it is essential to take geometric consistency between points into account. Computationally, the multi-match…

2018-11-26abs ↗pdf ↗

Completed volumes match with combinatorial classes of the double ramification cycle.

problem Computing Masur-Veech volumes for quadratic differentials.
method Describing components of the double ramification cycle and their excess intersection classes, leading to a recursion for completed volumes.
result Completed volumes agree with top intersection of tautological classes on the double ramification cycle.

Business cycles tend to comove across countries. However, standard models that attribute comovement to propagation of exogenous shocks struggle to generate a level of comovement that is as high as in the data. In this paper, we consider models that produce business cycles endogenously, through some form of non-linear d…

2020-02-16abs ↗pdf ↗

A new method compares persistent cycles in topological data.

problem Comparing persistent homology representations of two spaces.
method Direct comparison of individual persistent cycles based on persistence intervals and spatial placement.
result Demonstrated the effectiveness of the method in topological inference.

Deep learning improves 3D microscopy resolution without matched target images.

problem Anisotropic resolution in volumetric fluorescence microscopy.
method Cycle-consistent generative adversarial network trained on unpaired 2D images.
result Enhanced axial resolution and restored details between imaging planes.

This paper presents geometrical foundation for a systematic treatment of three main (elliptic, parabolic and hyperbolic) types of analytic function theories based on the representation theory of SL(2,R) group. We describe here geometries of corresponding domains. The principal role is played by Clifford algebras of mat…

2005-12-17abs ↗pdf ↗

We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every face of a planar embedding of the graph in order to capture the effect of unary potentials. A ground state of the resulting approximation can…

2011-04-06abs ↗pdf ↗

Optimizes experiment design for causal structure learning in linear models with cycles.

problem Causal structure learning from combined observational and interventional data in linear non-Gaussian cyclic models.
method Combinatorial characterization of equivalence classes, adaptive stochastic optimization, greedy policy with near-optimal performance guarantee, sampling-based estimator for reward function.
result Optimal experiment design reduces the equivalence class of causal graphs to a single true graph with a small number of interventions.

Paper bridges matching rules and height functions in aperiodic tilings.

problem Relationship between matching rules and height functions in aperiodic tilings.
method Cochain-first framework to establish equivalence between matching rules, Ammann bar continuity, cycle closure of 1-cochains, and height-function existence.
result Unified framework for aperiodic tilings including Penrose and canonical projection tilings.

New proof confirms operations on constructible functions match theory.

problem Matching operations on constructible functions with generalized valuations theory.
method Comparison with characteristic cycles approach.
result Operations on constructible functions match generalized valuations theory under mild assumptions.

Improved GPLVM model for single-cell RNA-seq data.

problem Lack of effective scalable models for clustering cell types in large-scale single-cell RNA-seq data.
method Introduces amortized stochastic variational Bayesian GPLVM (BGPLVM) tailored for single-cell RNA-seq.
result Matches the performance of scVI on synthetic and real-world datasets and reveals more interpretable latent structures.

During the development of AlphaGo, its many hyper-parameters were tuned with Bayesian optimization multiple times. This automatic tuning process resulted in substantial improvements in playing strength. For example, prior to the match with Lee Sedol, we tuned the latest AlphaGo agent and this improved its win-rate from…

2018-12-17abs ↗pdf ↗

Real Milnor fibres become contractible after attaching handles, matching classical results.

problem Topology of real isolated hypersurface singularities.
method Proving real Milnor fibres contractible after attaching handles, defining real vanishing cycles.
result Integer homology groups of real Milnor fibres are isomorphic to those of a bouquet of spheres under certain conditions.

We investigate triangulations of the two-dimensional sphere and torus with the faces properly colored white and black. We focus on matchings between white triangles and incident vertices. On the torus our objects are perfect pairings, whereas on the sphere this is only true after removing one triangle and its vertices.…

2018-08-18abs ↗pdf ↗

Optimal Morse matchings reveal essential structures of cell complexes which lead to powerful tools to study discrete geometrical objects, in particular discrete 3-manifolds. However, such matchings are known to be NP-hard to compute on 3-manifolds, through a reduction to the erasability problem. Here, we refine the stu…

2013-03-28abs ↗pdf ↗

Parameterized state space models in the form of recurrent networks are often used in machine learning to learn from data streams exhibiting temporal dependencies. To break the black box nature of such models it is important to understand the dynamical features of the input driving time series that are formed in the sta…

2019-07-15abs ↗pdf ↗

New algorithm improves PPS for multi-object matching.

problem Efficiently synchronize partial permutations for multi-object matching.
method Proposed CEMP-Partial algorithm for partial permutation synchronization (PPS). Uses sparse matrix operations and nonconvex weighted projected power method.
result Proves CEMP-Partial can exactly classify corrupted and clean partial permutations under adversarial corruption.

Combining deep learning and ensemble smoothers for better history matching.

problem Dealing with complex facies distributions in history matching.
method Using autoencoders and generative adversarial networks to parameterize facies models, applying distance-based localization.
result Improved history matching performance with deep learning parameterizations.

Odd crossing numbers and even rotation numbers for cycles in plane immersions.

problem Analyzing crossing and rotation numbers of cycles in plane immersions of graphs.
method Generic immersions and Legendrian embeddings of graphs, focusing on cycles of specific lengths.
result Sum of rotation numbers of all 5-cycles is even, and sum of crossing numbers is odd.

This paper resolves the all-or-nothing phase transition in graph matching.

problem Recovering vertex correspondence between edge-correlated random graphs.
method Analysis of mutual information, truncated second-moment computation, and maximum likelihood estimator.
result Sharp thresholds for correct matching in both dense and sparse graphs.

This paper identifies the unique efficient cycle for most hyperbolic manifolds but not for the figure-8 knot complement.

problem Identifying the unique efficient cycle for hyperbolic manifolds.
method Analyzing the limit of fundamental cycles and their 1\ell^1-norm convergence.
result The uniqueness of the efficient cycle is proven for most hyperbolic manifolds but not for the figure-8 knot complement.

Gauss diagrams' properties can change with Hamiltonian cycle choice.

problem The impact of Hamiltonian cycle choice on Gauss diagrams.
method Examined realizable and unrealizable Gauss diagrams, and proved preservation of realizability under certain Hamiltonian cycle changes.
result Properties of Gauss diagrams can vary with Hamiltonian cycle choice.

New algorithm for learning causal structures with disjoint cycles in linear non-Gaussian models.

problem Learning causal structures with cycles in linear non-Gaussian models.
method Characterizing when graphs determine the same model, using quadratic and cubic polynomial relations, and a strategy of decorrelating cycles and multivariate regression.
result Consistent and computationally efficient algorithm for learning causal structures with disjoint cycles.

Credit expansion led to stronger household leverage cycles during the U.S. business cycle.

problem Understanding the role of credit supply in the U.S. business cycle.
method Causal evidence from 1999-2010 U.S. business cycle data.
result Credit expansion, particularly in private-label mortgages, caused stronger household leverage cycles.

In the current article we study complex cycles of higher multiplicity in a specific polynomial family of holomorphic foliations in the complex plane. The family in question is a perturbation of an exact polynomial one-form giving rise to a foliation by Riemann surfaces. In this setting, a complex cycle is defined as a …

2011-06-14abs ↗pdf ↗

In the recent years, Riemannian shape analysis of curves and surfaces has found several applications in medical image analysis. In this paper we present a numerical discretization of second order Sobolev metrics on the space of regular curves in Euclidean space. This class of metrics has several desirable mathematical …

2015-06-29abs ↗pdf ↗

Smooth approximation of integral cycles mod 2 in Riemannian manifolds.

problem Approximating mod 2 integral cycles by smooth submanifolds.
method Approximation of mod 2 integral cycles by smooth submanifolds with controlled singularities.
result Every mod 2 integral cycle can be approximated by a smooth submanifold with a controlled singular set.

Constructs an explicit cycle in arithmetic group cohomology.

problem Cohomology of SLn(Z)_n(\mathbb{Z}) at virtual cohomological dimension.
method Geometric rigidity of Voronoi tessellations and abstract framework for polyhedral tessellations.
result Explicit canonical cycle in top-dimensional homology of Voronoi complex.

Using Kontsevich's identification of the homology of the Lie algebra l_infty with the cohomology of Out(F_r), Morita defined a sequence of 4k-dimensional classes mu_k in the unstable rational homology of Out(F_{2k+2}). He showed by a computer calculation that the first of these is non-trivial, so coincides with the uni…

2004-06-19abs ↗pdf ↗

We introduce a notion of vanishing Maslov index for lagrangian varifolds and lagrangian integral cycles in a Calabi-Yau manifold. We construct mass-decreasing flows of lagrangian varifolds and lagrangian cycles which satisfy this condition. The flow of cycles converges, at infinite time, to a sum of special lagrangian …

2016-06-08abs ↗pdf ↗