In this note we provide detailed derivations of two versions of small-variance asymptotics for hierarchical Dirichlet process (HDP) mixture models and the HDP hidden Markov model (HDP-HMM, a.k.a. the infinite HMM). We include derivations for the probabilities of certain CRP and CRF partitions, which are of more general…
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
48 results for “small-variance asymptotics”
Markov jump processes (MJPs) are used to model a wide range of phenomena from disease progression to RNA path folding. However, maximum likelihood estimation of parametric models leads to degenerate trajectories and inferential performance is poor in nonparametric models. We take a small-variance asymptotics (SVA) appr…
New topic model uses combinatorial optimization for faster, better results.
problem Improving topic modeling efficiency and quality.
method Derived a new objective function from LDA by small-variance asymptotics, solved combinatorially.
result New algorithm outperforms existing probabilistic methods.
New clustering algorithms capture time-evolving clusters using Markov models.
problem Capturing time-evolving clusters in data.
method Small-variance asymptotic analysis of Markov chain mixture models.
result Two clustering algorithms (D-Means and SD-Means) outperform existing methods in accuracy and computational cost.
Develops fast inference for nonparametric Bayesian LFRM.
problem Inference in LFRM is challenging and slow.
method Small-variance asymptotics framework for nonparametric Bayesian LFRM.
result Deterministic inference algorithms are fast and competitive.
Bayesian hierarchical clustering (BHC) is an agglomerative clustering method, where a probabilistic model is defined and its marginal likelihoods are evaluated to decide which clusters to merge. While BHC provides a few advantages over traditional distance-based agglomerative clustering algorithms, successive evaluatio…
The classical mixture of Gaussians model is related to K-means via small-variance asymptotics: as the covariances of the Gaussians tend to zero, the negative log-likelihood of the mixture of Gaussians model approaches the K-means objective, and the EM algorithm approaches the K-means algorithm. Kulis & Jordan (2012) us…
This work provides a semi-analytic approximation method for decoupled forwardbackward SDEs (FBSDEs) with jumps. In particular, we construct an asymptotic expansion method for FBSDEs driven by the random Poisson measures with σ-finite compensators as well as the standard Brownian motions around the small-variance limit …
The Dirichlet process mixture (DPM) is a ubiquitous, flexible Bayesian nonparametric statistical model. However, full probabilistic inference in this model is analytically intractable, so that computationally intensive techniques such as Gibb's sampling are required. As a result, DPM-based methods, which have considera…
In this paper, we propose a model-based clustering method (TVClust) that robustly incorporates noisy side information as soft-constraints and aims to seek a consensus between side information and the observed data. Our method is based on a nonparametric Bayesian hierarchical model that combines the probabilistic model …
Complex abelian varieties and quantum error correction: a mathematical framework for GKP codesmath.AG
Quantum codes linked to abelian varieties, providing mathematical rigor.
problem Quantum error correction through complex abelian varieties.
method Mathematical formulation of Gottesman-Kitaev-Preskill codes using abelian varieties.
result Asymptotic isometry of encoding, precise gate realizations, and failure probability optimization.
ANT learns sparse embeddings for large vocabularies efficiently.
problem Lack of scalable methods for embedding large vocabularies in neural networks.
method Anchor & Transform (ANT) algorithm that learns a small set of anchor embeddings and a sparse transformation matrix.
result ANT achieves stronger performance with fewer parameters (up to 40x compression) compared to existing methods.
New concentration inequality for U-statistics of Markov chains.
problem Proving a concentration inequality for U-statistics of order two in uniformly ergodic Markov chains.
method Inductive analysis using martingale techniques, uniform ergodicity, Nummelin splitting, and Bernstein's inequality.
result Recovery of convergence rate for U-statistics of independent random variables and canonical kernels, with improved results for dependent kernels.
We consider a stochastic bandit problem with infinitely many arms. In this setting, the learner has no chance of trying all the arms even once and has to dedicate its limited number of samples only to a certain number of arms. All previous algorithms for this setting were designed for minimizing the cumulative regret o…
New algorithms for topic model inference with provable guarantees.
problem Designing provable algorithms for inference in topic models.
method Leveraging topic model properties to construct simple linear estimators for topic proportions.
result Demonstrated that estimators correspond to well-concentrated posterior and can work with short documents.
We aim to design strategies for sequential decision making that adjust to the difficulty of the learning problem. We study this question both in the setting of prediction with expert advice, and for more general combinatorial decision tasks. We are not satisfied with just guaranteeing minimax regret rates, but we want …
Optimizes ranking from click feedback in a bandit setting.
problem Learning to rank from Bernoulli click feedback in a bandit setting.
method Variance-aware confidence sets derived from Bernstein and Chernoff bounds for optimal algorithms.
result Optimal algorithms for the case of small mean rewards, improving on previous suboptimal results.
Method minimizes electricity procurement cost based on demand prediction errors.
problem Minimizing electricity procurement cost in spot markets.
method Formulate method to minimize procurement cost over two parameters.
result Minimizes total electricity cost with known unit prices and prediction errors.
DLNs dynamics change with variance, leading to saddle-to-saddle training phases.
problem Understanding the dynamics of DLNs with varying initialization variance.
method Analyzing the phase transition of DLNs' dynamics as variance changes.
result Gradient descent visits a sequence of saddles, reaching a sparse global minimum.
k-means derived from Gaussian mixture models with isotropic Gaussians.
problem Clustering with Gaussian mixture models.
method Truncated variational EM approximations applied to Gaussian Mixture Models.
result k-means is a special case of variational EM for Gaussian Mixture Models.
Study compares priors for ABNs to improve model accuracy.
problem Inadequate priors lead to model selection issues in ABNs.
method Simulation study with three priors: Gaussian, Student's t, and strongly informative Gaussian.
result Informative Student's t-prior performs best, mitigating Lindley's paradox.
DIFF2: Differential Private Optimization via Gradient Differences for Nonconvex Distributed Learningcs.LG
DIFF2 improves differential privacy in nonconvex optimization with better utility bounds.
problem Improving differential privacy in nonconvex optimization with better utility bounds.
method DIFF2 constructs a differential private global gradient estimator using gradient differences.
result DIFF2 achieves a utility of \(\widetilde O(d^{2/3}/(n\varepsilon_{\mathrm{DP}})^{4/3})\), significantly better than \(\widetilde O(\sqrt{d}/(n\varepsilon_{\mathrm{DP}}))\).
LMC algorithm converges to target in Chi-squared and Renyi divergence.
problem Sampling from target distribution using LMC with strong dissipativity and smoothness conditions.
method LMC algorithm with strong dissipativity and first-order smoothness, initialized with Gaussian.
result LMC reaches ε-neighborhood of target in Chi-squared and Renyi divergence in O(λ²dε⁻¹) steps.
Study evaluates uncertainty quantification for atomistic neural networks, revealing complex relationships between error and uncertainty.
problem Uncertainty quantification for predictions of atomistic neural networks.
method Modified PhysNet NN architecture, evaluated with various metrics, analyzed QM9 and tautomerization reaction databases.
result Error and uncertainty are not linearly related; redundancy and noise complicate predictions, especially for small changes.
New algorithm samples neural network posteriors efficiently.
problem Challenges of sampling multimodal Bayesian posteriors for neural networks.
method Greedy Bayes method using log-concave coupling of posterior and auxiliary random variable.
result Log-concave coupling facilitates efficient sampling of neuron weights.
Researchers geometrically define asymptotic coordinates in General Relativity.
problem Understanding the asymptotic behavior of relativistic initial data sets.
method Geometrization of asymptotic flatness and analysis of geometric invariants.
result Geometrically defined asymptotic coordinates for mass, energy, momentum, and angular momentum.
On asymptotic property Cmath.GT
New findings on asymptotic property C in infinite dimensional spaces.
problem Understanding infinite dimensional spaces with infinite asymptotic dimension.
method Showed preservation of asymptotic property C in infinite products and introduced hyperbolic property C.
result Infinite products and restricted direct products of countable groups with finite asymptotic dimension have asymptotic property C.
Study on potential behavior in special geometric spaces.
problem Understanding potential behavior in specific geometric spaces.
method Analyzing asymptotic behavior of -capacitary potentials and weak Inverse Mean Curvature Flow.
result Characterized the behavior of potentials in Asymptotically Conical manifolds.
Local asymptotic minimax risk bounds in a locally asymptotically mixture of normal family of distributions have been investigated under asymmetric loss functions and the asymptotic distribution of the optimal estimator that attains the bound has been obtained.
The paper defines a new condition for Fano manifolds and shows its implications on their asymptotic behavior.
problem Understanding the asymptotic behavior of Fano manifolds.
method Introducing the asymptotically Mittag-Leffler condition and proving its implications on the -function.
result The -function of a Fano manifold exhibits exponential growth if it is asymptotically Mittag-Leffler.
We introduce the notion of asymptotic cohomology based on the bounded cohomology and define cohomological asymptotic dimension $\as_{\Z} X$ of metric spaces. We show that it agrees with the asymptotic dimension $\as X$ when the later is finite. Then we use this fact to construct an example of a metric space of boun…
New self-expander found between two given asymptotic ones.
problem Finding new self-expanders between given asymptotic ones.
method Developed a min-max theory for asymptotically conical self-expanders of mean curvature flow.
result Existence of a new asymptotically conical self-expander trapped between two given ones.
New bound on ECH sub-leading asymptotics.
problem Understanding ECH capacities in detail.
method Analyzing sub-leading asymptotics of ECH spectrum.
result New bound on sub-leading asymptotics of ECH capacities.
We prove the dimension of any asymptotic cone over a metric space X does not exceed the asymptotic Assouad-Nagata dimension of X. This improves a result of Dranishnikov and Smith who showed that dim(Y) does not exceed asymptotic Assouad-Nagata dimension of X for all separable subsets Y of special asymptotic cones of X …
Study Blaschke's asymptotic lines on surfaces in 3D space.
problem Characterize Blaschke's asymptotic lines on surfaces in 3D.
method Analyze binary differential equations near cusp and umbilic points.
result Describe Blaschke's asymptotic lines near Euclidean parabolic set.
Geodesic lines with specific boundaries found on a special type of manifold.
problem Existence of geodesic lines with prescribed asymptotic boundaries.
method Proper exponential map assumption, solution to the asymptotic Plateau problem.
result Existence of geodesic lines with Morse index ≤ n-1.
Researchers extend asymptotic analysis to Bergman projections with Gevrey weights.
problem Analyzing Bergman projections with Gevrey weights.
method Extending direct approach to semiclassical asymptotics to Gevrey weights using Fourier integral operators.
result Gevrey symbol amplitude of asymptotic Bergman projection with Gevrey weights and Gevrey-type growth rate.
We study the asymptotics of a family of link invariants on the orbits of a smooth volume-preserving ergodic vector field on a compact domain of the 3-space. These invariants, called linear saddle invariants, include many concordance invariants and generate an infinite-dimensional vector space of link invariants. In con…
Asymptotic gluing of asymptotically hyperbolic solutions to the Einstein constraint equationsmath.DG
We show that asymptotically hyperbolic solutions of the Einstein constraint equations with constant mean curvature can be glued in such a way that their asymptotic regions are connected.
This paper studies asymptotic multivariate expectiles in risk measures.
problem Understanding the asymptotic behavior of multivariate expectiles in risk measures.
method Investigates asymptotic multivariate expectiles in a multivariate regular variations context, proposing estimators for specific tail conditions.
result Proposes estimators for multivariate asymptotic expectiles under various tail conditions.
The paper studies reward concentration in MDPs, covering asymptotic and non-asymptotic settings.
problem Reward concentration in Markov Decision Processes (MDPs).
method Unified approach to reward concentration in MDPs, including asymptotic and non-asymptotic bounds.
result Rate-equivalent definitions of regret for learning policies.
Unique steady and expanding solitons with spherical links identified.
problem Characterizing steady and expanding Ricci solitons with specific asymptotic symmetries.
method Symmetry principle applied to asymptotically cylindrical and conical GRSs, proving uniqueness for Bryant solitons.
result Bryant steady and expanding solitons are the unique asymptotically cylindrical and conical GRSs with spherical links under certain conditions.
We study asymptotically harmonic manifolds of negative curvature, without any cocompactness or homogeneity assumption. We show that asymptotic harmonicity provides a lot of information on the asymptotic geometry of these spaces: in particular, we determine the volume entropy, the spectrum and the relative densities of …
VIX options in Bergomi modelsq-fin.PR
Study leading-order asymptotics for VIX option prices in Bergomi models.
problem Understanding VIX option pricing in Bergomi models.
method Analytical approach to derive leading-order asymptotics for VIX option prices in Bergomi models.
result Closed-form solutions for VIX option prices in Bergomi models are derived.
Asymptotic dimension of planes and graphs is at most three.
problem Understanding the geometric complexity of planes and graphs.
method Analyzing geodesic spaces and their homeomorphisms to subsets in the plane.
result The asymptotic dimension of the plane and any planar graph is at most three.
Unified approach to compute asymptotic constants using optimization.
problem Computing unknown constants in asymptotic expansions.
method Linear Least Squares and Tikhonov Linear Least Squares methods.
result Rigorous asymptotic estimates and convergence-rate guarantees.
Study proves uniqueness of asymptotic limits for specific manifolds.
problem Proving uniqueness of asymptotic limits for Ricci-flat manifolds with linear volume growth.
method Established using natural curvature and cross section assumptions.
result Uniqueness and exponential convergence rate for complete noncollapsed Ricci-flat manifolds with linear volume growth.
Paper proposes a debiased estimator for adaptive linear regression.
problem Non-normal asymptotic behavior of OLS estimator in adaptive linear regression.
method Adaptive linear estimating equations to construct debiased estimator.
result Established asymptotic normality of the debiased estimator.