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

110221331441 · Jun 202019922001200920172026
48 results for branching processes

New method for ancestral inference in branching processes with random environments.

problem Determining ancestor distribution parameters in branching processes with random environments.
method Generalized method of moments for ancestral inference.
result Limiting distribution of ancestor and offspring estimators decouple and converge to independent Gaussian variables under certain conditions.

Study on deep neural networks using branching processes and Mehler's formula.

problem Understanding the mathematical role of activation functions in compositional neural networks.
method Connection between compositional kernels and branching processes via Mehler's formula; new random features algorithm.
result Explicit formulas for eigenvalues of compositional kernels quantify complexity.

We compute exact values respectively bounds of "distances" - in the sense of (transforms of) power divergences and relative entropy - between two discrete-time Galton-Watson branching processes with immigration GWI for which the offspring as well as the immigration is arbitrarily Poisson-distributed (leading to arbitra…

2010-05-20abs ↗pdf ↗

Develops a machine learning method for parameter estimation in branching processes models.

problem Parameter evaluation for unevenly distributed sparse and dense regions in stochastic datasets.
method Approximate Bayesian computation based on Isolation Kernel mapping and maxima weighted kernel.
result Effective parameter estimation for cancer cell evolution models using personal data.

We introduce a model-independent approximation for the branching ratio of Hawkes self-exciting point processes. Our estimator requires knowing only the mean and variance of the event count in a sufficiently large time window, statistics that are readily obtained from empirical data. The method we propose greatly simpli…

2014-03-20abs ↗pdf ↗

A new algorithm optimizes Gaussian process posterior mean functions efficiently.

problem Optimizing Gaussian process posterior mean functions over hyperrectangles is challenging due to nonlinearity and nonconvexity.
method PALM-Mean, a piecewise-analytic lower-bounding framework embedded in reduced-space spatial branch-and-bound.
result PALM-Mean improves scalability for large datasets compared to general-purpose solvers.

This paper models stock prices using a Janardan Galton Watson process.

problem Modeling stock price fluctuations and predicting market trends.
method Extends Janardan Galton Watson process to model stock prices, considering initial close price and number of offspring.
result The model predicts return values and probability of market extinction.

New method for global optimization of Gaussian processes reduces computational time.

problem Nonconvex optimization problems with Gaussian processes trained on few data points.
method Reduced-space formulation with branch-and-bound solver and McCormick relaxations.
result Significantly reduced computational time compared to state-of-the-art methods.

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.

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.

Automated multi-task learning algorithm that optimizes network topology.

problem Over-sharing in multi-task learning leads to over-generalization and suboptimal performance.
method Tree-structured design space with gumbel-softmax sampling for differentiable network splitting.
result End-to-end trainable algorithm that optimizes network topology for multiple objectives across tasks.

First we provide a simple set of sufficient conditions for the weak convergence of scaled affine processes with state space R+×RdR_+ \times R^d. We specialize our result to one-dimensional continuous state branching processes with immigration. As an application, we study the asymptotic behavior of least squares estimators…

2012-10-05abs ↗pdf ↗

Unified GP model optimizes hyperparameters with conditional dependence.

problem Efficient tuning of hyperparameters in neural networks.
method Unified Bayesian optimization framework based on a new Gaussian process (GP) model.
result Higher prediction accuracy and better optimization efficiency observed.

Branching Flows generates sequences of varying lengths using binary trees.

problem Generating sequences of unknown lengths or fixed elements.
method A generative modeling framework that evolves states over binary trees, controlling sequence length.
result Branching Flows can generate sequences of varying lengths and mix different types of state spaces.

A GPU framework speeds up BnB for discrete optimization problems.

problem Optimizing large-scale discrete problems with GPU limitations.
method Parallel BnB nodes in GPU batches, using padding and custom kernels.
result One to two orders of magnitude speedup and zero optimality gap.

Several models of stock trading [P. Bak et al, Physica A {\bf 246}, 430 (1997)] are analyzed in analogy with one-dimensional, two-species reaction-diffusion-branching processes. Using heuristic and scaling arguments, we show that the short-time market price variation is subdiffusive with a Hurst exponent H=1/4H=1/4. Biase…

1998-11-09abs ↗pdf ↗

The deployment of deep neural networks in real-world applications is mostly restricted by their high inference costs. Extensive efforts have been made to improve the accuracy with expert-designed or algorithm-searched architectures. However, the incremental improvement is typically achieved with increasingly more expen…

2019-05-13abs ↗pdf ↗

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.

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 ↗

In this note we find a formula for the supremum distribution of spectrally positive or negative Lévy processes with a broken linear drift. This gives formulas for ruin probabilities in the case when two insurance companies (or two branches of the same company) divide between them both claims and premia in some specifie…

2018-04-18abs ↗pdf ↗

This paper focuses on a class of linear Hawkes processes with general immigrants. These are counting processes with shot noise intensity, including self-excited and externally excited patterns. For such processes, we introduce the concept of age pyramid which evolves according to immigration and births. The virtue if t…

2015-04-24abs ↗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 ↗

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.