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

Trend · papers per month

25.0%50.0%75.0%100.0% · Feb 199419922001200920172026
48 results for recipe completion

A recipe recommendation system suggests missing ingredients using collaborative filtering.

problem Encouraging healthy diets through personalized ingredient suggestions.
method Item-based collaborative filtering applied to a sparse dataset of recipes.
result Best method achieves a recall@10 of circa 40%.

Many recent Markov chain Monte Carlo (MCMC) samplers leverage continuous dynamics to define a transition kernel that efficiently explores a target distribution. In tandem, a focus has been on devising scalable variants that subsample the data and use stochastic gradients in place of full-data gradients in the dynamic s…

2015-06-15abs ↗pdf ↗

Unified theory of measure-preserving diffusions on manifolds.

problem Deriving a complete recipe for measure-preserving diffusions on manifolds.
method Developed a geometric theory that unifies and generalizes previous constructions, relying on intrinsic geometry of the target measure.
result The completeness result is a direct consequence of manifold topology and target measure geometry.

Modified RV-coefficient reveals how training affects neural network representations.

problem Understanding how training affects intermediate representations in convolutional neural networks.
method Experimented with modified RV-coefficient (RV2) to compare activation patterns in deep networks trained on varying amounts of data and layers.
result RV2 successfully recovered expected similarity patterns and provided interpretable similarity matrices.

This paper develops tools for nonreversible MCMC with convergence guarantees.

problem Designing nonreversible MCMC kernels with convergence guarantees.
method Develops tools for nonreversible Markov kernels using conditional invertible transforms.
result Ensures nonreversible kernels have the desired invariance property and lead to convergent algorithms.

Improved robustness in ASR systems with speaker adaptation.

problem Improving robustness in automatic speech recognition systems.
method Weighted-Simple-Add method for adding weighted speaker information vectors to the conformer-based acoustic model.
result Achieved 11% relative improvement in WER on Switchboard 300h Hub5'00 dataset.

In this paper we study maps (curved flats) into symmetric spaces which are tangent at each point to a flat of the symmetric space. Important examples of such maps arise from isometric immersions of space forms into space forms via their Gauss maps. Further examples are found in conformal geometry, e.g. the curved flats…

1995-07-08abs ↗pdf ↗

New algorithm improves inference for flexible models with infinite latent features.

problem Inference for models with infinite latent features is computationally challenging and limiting.
method Adaptive slice sampling for posterior inference with general completely random measures.
result Higher effective sample size and predictive performance compared to existing methods.

We give a recipe for constructing families of distinct knots that have identical Khovanov homology and give examples of pairs of prime knots, as well as infinite families, with this property.

2006-06-25abs ↗pdf ↗

Twisted SL2C\operatorname{SL}_2 \mathbb{C} local systems on surfaces of finite type appear often in geometry and physics. Most of them arise geometrically as local systems of charts for pleated hyperbolic structures. Bonahon and Thurston's "shear-bend coordinates" parameterize these local systems of charts. On a surface …

2015-10-20abs ↗pdf ↗

Recent years have seen a flurry of activities in designing provably efficient nonconvex procedures for solving statistical estimation problems. Due to the highly nonconvex nature of the empirical loss, state-of-the-art procedures often require proper regularization (e.g. trimming, regularized cost, projection) in order…

2017-11-28abs ↗pdf ↗

New graph foundation models respect symmetries for broader applicability.

problem Tailored graph machine learning architectures limit broader applicability.
method Investigates symmetries for label and feature permutations, proving network universal approximator.
result Universal approximator on multisets respecting node and feature permutations.

Improves model accuracy for neural nets in stochastic dynamics with partial prior knowledge.

problem Stability and accuracy in neural nets modeling stochastic dynamics with many parameters.
method Three steps: probabilistic weights, partial knowledge incorporation, and PAC-Bayesian training.
result Improved model fit with partial and noisy prior knowledge.

We give a recipe to compute the geometric intersection number of an integral lamination with a particular type of integral lamination on an n-times punctured disk. This provides a way to find the geometric intersection number of two arbitrary integral laminations when combined with an algorithm of Dynnikov and Wiest.

2012-06-22abs ↗pdf ↗

GNMR controls runtime stability in low-precision language model training.

problem Efficient low-precision training faces numerical risks at specific operators.
method GNMR compares gradient norms to historical means, applying bounded recovery actions.
result GNMR preserves high-fidelity quality with sparse, budgeted recovery.

In this document we are going to derive the equations needed to implement a Variational Bayes estimation of the parameters of the simplified probabilistic linear discriminant analysis (SPLDA) model. This can be used to adapt SPLDA from one database to another with few development data or to implement the fully Bayesian…

2015-11-20abs ↗pdf ↗

An enhanced trivalent tangle is a trivalent tangle with some of its edges labeled. We use enhanced trivalent tangles and classical knot theory to provide a recipe for constructing invariants for trivalent tangles, and in particular, for knotted trivalent graphs. Our method also yields invariants of, what we refer to as…

2018-06-17abs ↗pdf ↗

A standard recipe for spoken language recognition is to apply a Gaussian back-end to i-vectors. This ignores the uncertainty in the i-vector extraction, which could be important especially for short utterances. A recent paper by Cumani, Plchot and Fer proposes a solution to propagate that uncertainty into the backend. …

2017-09-29abs ↗pdf ↗

A Kahler metric is said to be Bochner-Kahler if its Bochner curvature vanishes. This is a nontrivial condition when the complex dimension of the underlying manifold is at least 2. In this article it will be shown that, in a certain well-defined sense, the space of Bochner-Kahler metrics in complex dimension n has real …

2000-03-16abs ↗pdf ↗

Unified framework for ranking-and-selection with multiple correct answers and non-answerable estimates

problem Fixed-precision ranking-and-selection in structured settings with non-unique answers and non-answerable estimates
method Unified framework based on answer-wise acceptance sets, restricted generalized likelihood ratio stopping, and answer-pitfall decomposition
result Unified recipe performs well across a broad range of pure-exploration problems

Proposes a new algorithm to estimate invariant subspaces across multilayer networks.

problem Estimating invariant subspaces across heterogeneous multiple networks.
method Bias-corrected joint spectral embedding algorithm that recursively calibrates diagonal bias and iteratively updates the subspace estimator.
result Established entrywise subspace perturbation bound and entrywise eigenvector central limit theorem for the algorithm.

Variational inference relies on flexible approximate posterior distributions. Normalizing flows provide a general recipe to construct flexible variational posteriors. We introduce Sylvester normalizing flows, which can be seen as a generalization of planar flows. Sylvester normalizing flows remove the well-known single…

2018-03-15abs ↗pdf ↗

We prove that the so-called t algebra of braids and ties supports a Markov trace. Further, by using this trace in the Jones' recipe, we define invariant polynomials for classical knots and singular knots. Our invariants have three parameters. The invariant of classical knots is an extension of the Homflypt polynomial a…

2014-08-25abs ↗pdf ↗

This paper tackles multilingual speech processing by optimizing conflicting objectives hierarchically.

problem Training models for multilingual, multi-task speech processing is hampered by conflicting objectives.
method Investigates three multi-objective MSP formulations and introduces a lightweight layer-selection mechanism.
result A bi-level recipe outperforms standard flat optimization in state-of-the-art MSP models.

New framework predicts AMP behavior in spiked models for finite iterations.

problem Understanding AMP dynamics in high-dimensional spiked models.
method Developed a non-asymptotic framework for AMP in spiked matrix estimation.
result Predicted AMP behavior for up to O(npolylogn)O\big(\frac{n}{\mathrm{poly}\log n}\big) iterations in Z2\mathbb{Z}_2 synchronization.

Paper proposes tensor-based method for semiconductor manufacturing process control.

problem Challenges of traditional process control methods in high-dimensional image-based overlay errors.
method Builds a high-dimensional process model, proposes tensor-on-vector regression algorithms, designs EWMA controller for tensor data.
result The method reduces overlay errors using limited control recipes and is superior especially when disturbances are not stable.

This paper considers the stability of online learning algorithms and its implications for learnability (bounded regret). We introduce a novel quantity called {\em forward regret} that intuitively measures how good an online learning algorithm is if it is allowed a one-step look-ahead into the future. We show that given…

2012-11-26abs ↗pdf ↗

Estimates Heston model with jumps in asset prices using Bayesian regression and particle filtering.

problem Estimating the Heston model with jumps in asset prices.
method Bayesian regression combined with particle filtering method to handle jumps.
result Improves the estimation of key parameters in the Heston model with jumps.

An important property for lifelong-learning agents is the ability to combine existing skills to solve unseen tasks. In general, however, it is unclear how to compose skills in a principled way. We provide a "recipe" for optimal value function composition in entropy-regularised reinforcement learning (RL) and then exten…

2018-07-12abs ↗pdf ↗

We introduce a two-parameters bt-algebra which, by specialization, becomes the one-parameter bt-algebra, introduced by the authors, as well as another one-parameter presentation of it; the invariant for links and tied links, associated to this two-parameter algebra via Jones recipe, contains as specializations the inva…

2018-11-08abs ↗pdf ↗