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

1223 · Jun 202019922001200920172026
46 results for Neal's funnel

Adaptive-stepsize MCMC sampling inspired by Adam optimizer.

problem Improving numerical stability and convergence speed in MCMC sampling.
method Time-rescaled Langevin dynamics with an auxiliary relaxation equation and adaptive stepsize control.
result Automatic stepsize control improves accuracy and stability in numerical experiments.

WALNUTS improves sampling efficiency and robustness for multi-scale distributions.

problem Adapting leapfrog step size for multi-scale posterior distributions.
method Adapts leapfrog step size at fixed intervals of simulated time, selecting the largest step size to keep energy error below a threshold.
result Substantial improvements in sampling efficiency and robustness compared to standard NUTS.

Delayed rejection HMC improves sampling efficiency for multiscale distributions.

problem Hamiltonian Monte Carlo struggles with wide-ranging distributions, especially in high-curvature areas.
method Introduces a delayed rejection variant of HMC, using geometrically smaller step sizes for retries.
result Up to five-fold performance gains in effective sample size per gradient evaluation.

The paper tackles decision making problems with funnel structure in email marketing campaigns.

problem Decision making challenges in systems with funnel structure, where fewer observations are received from deeper layers.
method Formulated as a contextual bandit with funnel structure and developed a multi-task learning algorithm.
result Our algorithms offer significant improvement over previous methods in email marketing campaigns.

Descending phase retrieval algorithms show a phase transition with increasing sample complexity.

problem Theoretical limits of descending phase retrieval algorithms.
method Utilizing Random duality theory (RDT), the study develops a generic program to characterize algorithm performance.
result As sample complexity increases, the parametric manifold transitions from multi to single funneling points, leading to a phase transition in algorithm success.

A novel method for estimating Bayesian network (BN) parameters from data is presented which provides improved performance on test data. Previous research has shown the value of representing conditional probability distributions (CPDs) via neural networks(Neal 1992), noisy-OR gates (Neal 1992, Diez 1993)and decision tre…

2013-01-10abs ↗pdf ↗

New method for Bayesian neural networks with unbounded weights.

problem Posterior inference for Bayesian neural networks with unbounded weights.
method Conditionally Gaussian representation for efficient posterior inference.
result Interpretable and computationally efficient procedure for posterior inference.

Multidimensional time series are sequences of real valued vectors. They occur in different areas, for example handwritten characters, GPS tracking, and gestures of modern virtual reality motion controllers. Within these areas, a common task is to search for similar time series. Dynamic Time Warping (DTW) is a common di…

2018-04-17abs ↗pdf ↗

We introduce the Pitman Yor Diffusion Tree (PYDT) for hierarchical clustering, a generalization of the Dirichlet Diffusion Tree (Neal, 2001) which removes the restriction to binary branching structure. The generative process is described and shown to result in an exchangeable distribution over data points. We prove som…

2011-06-13abs ↗pdf ↗

A major problem for the learning of Bayesian networks (BNs) is the exponential number of parameters needed for conditional probability tables. Recent research reduces this complexity by modeling local structure in the probability tables. We examine the use of log-linear local models. While log-linear models in this con…

2013-01-23abs ↗pdf ↗

Improves classifier performance in multi-stage selection processes.

problem Difficulty in training classifiers in multi-stage selection processes due to varying sample sizes and information.
method Multi-Stage Transfer Learning (MSGTL) approach that uses knowledge from simpler classifiers trained in early stages to improve later stages.
result MSGTL outperforms other transfer learning methods in real-world selection process data.

New particle algorithms optimize latent variable models.

problem Optimizing latent variable models for maximum likelihood estimation.
method Identify gradient flows associated with free energy functional and discretize them to create particle-based algorithms.
result Novel particle algorithms scale to high-dimensional settings and perform well in experiments.

On compact surfaces with or without boundary, Osgood, Phillips and Sarnak proved that the maximum of the determinant of the Laplacian within a conformal class of metrics with fixed area occurs at a metric of constant curvature and, for negative Euler characteristic, exhibited a flow from a given metric to a constant cu…

2009-09-04abs ↗pdf ↗

Whilst deep neural networks have shown great empirical success, there is still much work to be done to understand their theoretical properties. In this paper, we study the relationship between random, wide, fully connected, feedforward networks with more than one hidden layer and Gaussian processes with a recursive ker…

2018-04-30abs ↗pdf ↗

We prove exact BNN posterior convergence to GP limit and provide sampling methods.

problem Theoretical and empirical challenges in obtaining exact posterior distributions of wide BNNs.
method Theoretical proof and rejection sampling for generating exact samples.
result Exact BNN posterior converges to GP limit as width increases.

Study projective deformations of hyperbolic 3-orbifolds with turnover ends.

problem Deformations of hyperbolic 3-orbifolds with turnover ends in projective geometry.
method Projective deformations of hyperbolic 3-orbifolds with turnover ends, focusing on totally geodesic generalized cusps.
result Turnover funnels remain totally geodesic and the deformed projective 3-orbifold remains properly convex.

We define the beta diffusion tree, a random tree structure with a set of leaves that defines a collection of overlapping subsets of objects, known as a feature allocation. A generative process for the tree structure is defined in terms of particles (representing the objects) diffusing in some continuous space, analogou…

2014-08-14abs ↗pdf ↗

In the context of science, the well-known adage "a picture is worth a thousand words" might well be "a model is worth a thousand datasets." In this manuscript we introduce the SciML software ecosystem as a tool for mixing the information of physical laws and scientific models with data-driven machine learning approache…

2020-01-13abs ↗pdf ↗

This paper removes the finite variance assumption for deep convolutional neural networks.

problem Removing the finite variance assumption for deep convolutional neural networks.
method Assuming iid parameters distributed according to a stable distribution, the paper shows that the infinite-channel limit of a deep feed-forward convolutional neural network is a multivariate stable stochastic process.
result The infinite-channel limit of a deep feed-forward convolutional neural network, under suitable scaling, is a multivariate stable stochastic process.

In the first part of this work we explore the geometry of infinite type surfaces and the relationship between its convex core and space of ends. In particular, we show that a geodesically complete hyperbolic surface is made up of its convex core with funnels attached along the simple closed geodesic components and half…

2015-08-10abs ↗pdf ↗

Study improves cryptocurrency price prediction using unlabeled text data.

problem Predicting cryptocurrency returns from unlabelled text data.
method Introduced weak learning approach to finetune BERT on unlabeled text data.
result Finetuning pretrained NLP models with weak labels enhances forecast accuracy.

Maximizing product use is a central goal of many businesses, which makes retention and monetization two central analytics metrics in games. Player retention may refer to various duration variables quantifying product use: total playtime or session playtime are popular research targets, and active playtime is well-suite…

2017-01-04abs ↗pdf ↗

Develops a method for non-equilibrium importance sampling to estimate expectations and constants.

problem Estimating expectations and normalization constants for complex high-dimensional distributions.
method Generates samples from a base distribution, transports them using a velocity field, and averages along flowlines.
result The method can achieve zero-variance estimation and significantly reduces variance compared to vanilla estimators.

Improves classifier performance in multi-stage processes with adversarial autoencoders and multi-task learning.

problem Challenges in training classifiers due to varying sample sizes and information content across stages.
method Combines adversarial autoencoders, multi-task learning, and semi-supervised learning to address underfitting and overfitting.
result Our approach outperforms state-of-the-art methods across different domains.

A new method reduces complexity of normalizing flows for MCMC preconditioning.

problem Improving sampling efficiency in MCMC algorithms for complex target distributions.
method Factorized preconditioning architecture combining a linear component and a conditional NF.
result Significantly better tail samples and higher effective sample sizes on various distributions.

Gauge theory connects hyperbolic metrics to Virasoro orbits, revealing their geometric and topological properties.

problem Understanding the relationship between hyperbolic metrics and Virasoro orbits.
method Using SL(2,R) gauge theory on a cylinder, assigning flat SL(2,R) gauge fields to Virasoro orbits.
result Affirmative answer to the question that all Virasoro orbits arise as moduli spaces of hyperbolic metrics.

Bayesian deep neural networks converge to processes with α-stable marginals under infinite variance weights.

problem Representation learning in deep kernel processes is hindered by deterministic covariance kernels.
method Showed convergence to α-stable processes with conditionally Gaussian representations in infinite-width networks.
result Conditional random covariance kernels can be recursively linked, even if the process is α-stable.

Hyperelastic bodies in Riemannian manifolds can levitate due to curvature-induced forces.

problem Hyperelastic bodies in Riemannian manifolds can levitate due to curvature-induced forces.
method Numerical simulations of static solutions to a particular class of problems in hyperelastic mechanics.
result Hyperelastic bodies in Riemannian manifolds can levitate due to curvature-induced forces.