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

Trend · papers per month

2.5%5.0%7.5%10.0% · Jan 199519922001200920172026
48 results for branch reconstruction

StrTransformer recovers sources without labels by optimizing latent matrices and enforcing structural constraints.

problem Unsupervised blind source recovery in signal processing.
method Source-wise structured Transformer framework with latent source matrix optimization, structural regularization, and branch-specific weights.
result StrTransformer learns distinct temporal-scale structures and recovers source-aligned latent trajectories.

Improved phylogenetic tree reconstruction using flexible branch length distributions.

problem Inefficient Markov chain Monte Carlo methods for large sequence datasets.
method Variational Bayesian phylogenetic inference with semi-implicit branch length distributions.
result Proposed method improves marginal likelihood estimation and branch length posterior approximation.

Extends Khovanov homology spectral sequence using Heegaard Floer homology.

problem Relating Khovanov homology and Heegaard Floer homology of branched double covers.
method Involutive Heegaard Floer homology, bordered Floer homology, surgery exact triangle.
result Establishes spectral sequence connecting Khovanov homology and Heegaard Floer homology.

Gradient estimation techniques applied to programs with randomness in high energy physics.

problem Differentiating programs with discrete randomness in high energy physics.
method Several gradient estimation techniques, including Stochastic AD method, applied to simplified detector design experiments.
result Development of the first fully differentiable branching program.

Improved image reconstruction and anomaly detection using hierarchical VAEs.

problem VAEs struggle with sharp images and high-level features.
method Added a new branch to hierarchical VAEs to separate high-level and low-level features.
result Results in sharper images and better anomaly detection.

Single-cell gene expression data provide invaluable resources for systematic characterization of cellular hierarchy in multi-cellular organisms. However, cell lineage reconstruction is still often associated with significant uncertainty due to technological constraints. Such uncertainties have not been taken into accou…

2016-01-12abs ↗pdf ↗

We present a method for the reconstruction of networks, based on the order of nodes visited by a stochastic branching process. Our algorithm reconstructs a network of minimal size that ensures consistency with the data. Crucially, we show that global consistency with the data can be achieved through purely local consid…

2010-06-04abs ↗pdf ↗

An algorithmically hard phase was described in a range of inference problems: even if the signal can be reconstructed with a small error from an information theoretic point of view, known algorithms fail unless the noise-to-signal ratio is sufficiently small. This hard phase is typically understood as a metastable bran…

2018-05-15abs ↗pdf ↗

In real-world and online social networks, individuals receive and transmit information in real time. Cascading information transmissions (e.g. phone calls, text messages, social media posts) may be understood as a realization of a diffusion process operating on the network, and its branching path can be represented by …

2016-03-29abs ↗pdf ↗

New deep learning model for matrix completion combining linear and nonlinear relationships.

problem Matrix completion considering only linear or nonlinear relations, ignoring latent relationships.
method Combines linear and nonlinear models in a latent variables framework, using a deep neural network with two branches for columns and rows, and manifold learning as an auxiliary task.
result Experimental results show the proposed method outperforms state-of-the-art matrix completion methods.

The paper proves a Minkowski-like theorem for tetrahedra in dS3 and AdS3.

problem Formulating and proving a constant-curvature, holonomy-valued Lorentzian analogue of Minkowski theorem for tetrahedra.
method Formulated and proved a Lorentzian analogue of Minkowski theorem for tetrahedra in dS3 and AdS3.
result A unique strictly convex tetrahedron can be reconstructed from four non-trivial based SO+(1,2) holonomies.

ST-STORM separates semantic and appearance features for robust representation learning.

problem Traditional SSL methods fail to capture appearance cues in critical applications.
method Hybrid SSL framework with two latent streams, Content and Style, disentangled through gating mechanisms.
result The Style branch effectively isolates complex appearance phenomena without degrading semantic performance.

CNPs improve function approximation by contrastive learning.

problem Learning from non-i.i.d function instantiations in high-dimensional, noisy spaces.
method CNPs with TCL and FCL contrastive branches for better function approximation.
result CNPs outperform other variants in function distribution reconstruction and parameter identification.

Study on moduli spaces of branched projective structures on surfaces.

problem Characterizing and understanding moduli spaces of branched projective structures.
method Analytic and geometric methods to study the moduli spaces of branched projective structures.
result The moduli space of marked branched projective structures is a complex analytic space with specific dimensions and singular points.

Improved Compressed Sensing by optimizing sparse solutions with mixed integer programming.

problem Finding sparse solutions to linear measurements with numerical tolerance.
method Introducing an 2\ell_2 regularized formulation, reformulating as a mixed integer second order cone program, deriving a second order cone relaxation, and developing a custom branch-and-bound algorithm.
result Our approach produces solutions that are on average 6.22% more sparse compared to state-of-the-art methods.

We define a laminar branched surface to be a branched surface satisfying the following conditions: (1) Its horizontal boundary is incompressible; (2) there is no monogon; (3) there is no Reeb component; (4) there is no sink disk (after eliminating trivial bubbles in the branched surface). The first three conditions are…

2002-03-31abs ↗pdf ↗

Given a branched covering of degree d between closed surfaces, it determines a collection of partitions of d, the branch data. In this work we show that any branch data are realized by an indecomposable primitive branched covering on a connected close surface N with Euler's characteristic less than or equal to 0. This …

2007-07-19abs ↗pdf ↗

Techniques for constructing codimension 2 embeddings and immersions of the 2 and 3-fold branched covers of the 3 and 4-dimensional spheres are presented. These covers are in braided form, and it is in this sense that they are folded. More precisely the composition of the embedding (or immersion) and the canonical proje…

2013-01-17abs ↗pdf ↗

Study continuous deformations of branched projective structures on surfaces, preserving holonomy and branch points.

problem Continuous deformations of branched projective structures on closed surfaces of genus g2g\geq 2.
method Schiffer variations and analysis of canonical divisors.
result Branch points are necessarily arranged on a canonical divisor when the underlying complex structure is infinitesimally preserved.

New examples show transverse knots are determined by their branched covers.

problem Transverse knots and their isotopy classes.
method Constructing and analyzing non-isotopic transverse knots with contactomorphic cyclic branched covers.
result Transverse isotopy classes of many transverse knots are determined by the contactomorphism type of their cyclic branched covers.

We establish a calculus for branched spines of 3-manifolds by means of branched Matveev-Piergallini moves and branched bubble-moves. We briefly indicate some of its possible applications in the study and definition of State-Sum Quantum Invariants.

2004-02-29abs ↗pdf ↗

Quantized Coulomb branches linked to skein algebras.

problem Understanding the relationship between quantized Coulomb branches and skein algebras.
method Association of quantized Coulomb branches to surfaces, description of relationship for specific surfaces, formulation of a conjecture.
result A conjecture linking quantized Coulomb branches and skein algebras.

We prove that if S is a closed compact surface of negative Euler characteristic, and if R is a quasi-Fuchsian representation in PSL(2,C), then the deformation space M(k,R) of branched projective structures on S with total branching order k and holonomy R is connected, as soon as k>0. Equivalently, two branched projecti…

2012-03-27abs ↗pdf ↗

Branched covers between Riemann surfaces are associated with certain combinatorial data, and Hurwitz existence problem asks whether given data satisfying those combinatorial constraints can be realized by some branched cover. We connect recent development in spherical conic metrics to this old problem, and give a new m…

2018-05-08abs ↗pdf ↗

Authors prove a contact structure result using branched covers and overtwisted disks.

problem Proving a contact structure result using branched covers and overtwisted disks.
method Explicitly constructing an overtwisted disk in the pp-fold cyclic branched cover of S3S^3.
result An overtwisted disk is contained in the complement of the branch locus.

We introduce and analyze the characteristic foliation induced by a contact structure on a branched surface, in particular a branched standard spine of a 3-manifold. We extend to (fairly general) singular foliations of branched surfaces the local existence and uniqueness results which hold for genuine surfaces. Moreover…

1998-09-29abs ↗pdf ↗