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.
Vecchia approximations provide the best accuracy-runtime trade-off for Gaussian process approximations.
New activation functions achieve arbitrary-accuracy Sobolev approximation by fixed-size neural networks.
New CFNN architecture approximates functions with machine accuracy.
We derive caplet volatilities for quadratic models, providing an asymptotic approximation.
A theory for approximating complex concepts with simple decision trees.
We propose a black-box variational inference method to approximate intractable distributions with an increasingly rich approximating class. Our method, termed variational boosting, iteratively refines an existing variational approximation by solving a sequence of optimization problems, allowing the practitioner to trad…
Single tree outperforms random forest in testing accuracy.
New methods improve statistical accuracy of complex models without high computational cost.
We discuss Bayesian methods for learning Bayesian networks when data sets are incomplete. In particular, we examine asymptotic approximations for the marginal likelihood of incomplete data given a Bayesian network. We consider the Laplace approximation and the less accurate but more efficient BIC/MDL approximation. We …
TADDAA improves accuracy diagnostics for variational approximations.
This paper presents by simulation how approximate multipliers can be utilized to enhance the training performance of convolutional neural networks (CNNs). Approximate multipliers have significantly better performance in terms of speed, power, and area compared to exact multipliers. However, approximate multipliers have…
Generalizes SMCI to improve Boltzmann machine learning accuracy.
Matrix approximation is a common tool in machine learning for building accurate prediction models for recommendation systems, text mining, and computer vision. A prevalent assumption in constructing matrix approximations is that the partially observed matrix is of low-rank. We propose a new matrix approximation model w…
Linear cost method approximates Gaussian Matérn processes with exponentially convergent accuracy.
Sampling strategies significantly affect feature approximations in ELA, impacting classifier accuracy.
In this work, we investigate the value of employing deep learning for the task of wireless signal modulation recognition. Recently in [1], a framework has been introduced by generating a dataset using GNU radio that mimics the imperfections in a real wireless channel, and uses 10 different modulation types. Further, a …
Stochastic gradient descent optimizes Nyström samples for kernel matrix approximation.
Low-rank approximation is an effective model compression technique to not only reduce parameter storage requirements, but to also reduce computations. For convolutional neural networks (CNNs), however, well-known low-rank approximation methods, such as Tucker or CP decomposition, result in degraded model accuracy becau…
New expressive losses improve adversarial robustness without sacrificing accuracy.
A new Kolmogorov-Arnold network improves function approximation and optimization.
Paper offers a simple CDS approximation formula with high accuracy.
Test log-likelihood comparisons can be misleading.
New algorithm balances spatial data approximation and prediction accuracy.
Nyström KPCA balances computational efficiency and statistical accuracy.
Reduced modeling of a computationally demanding dynamical system aims at approximating its trajectories, while optimizing the trade-off between accuracy and computational complexity. In this work, we propose to achieve such an approximation by first embedding the trajectories in a reproducing kernel Hilbert space (RKHS…
New quantization methods improve accuracy of Random Fourier Features.
Gaussian and bootstrap methods improve ATE estimator accuracy.
We present a new method to approximate posterior probabilities of Bayesian Network using Deep Neural Network. Experiment results on several public Bayesian Network datasets shows that Deep Neural Network is capable of learning joint probability distri- bution of Bayesian Network by learning from a few observation and p…
In likelihood-free settings where likelihood evaluations are intractable, approximate Bayesian computation (ABC) addresses the formidable inference task to discover plausible parameters of simulation programs that explain the observations. However, they demand large quantities of simulation calls. Critically, hyperpara…
Covariance pooling is a feature pooling method with good classification accuracy. Because covariance features consist of second-order statistics, the scale of the feature elements are varied. Therefore, normalizing covariance features using a matrix square root affects the performance improvement. When pooling methods …
Efficiently approximates fairness-accuracy trade-offs for diverse datasets.
The future predictive performance of a Bayesian model can be estimated using Bayesian cross-validation. In this article, we consider Gaussian latent variable models where the integration over the latent values is approximated using the Laplace method or expectation propagation (EP). We study the properties of several B…
Approximate probabilistic inference algorithms are central to many fields. Examples include sequential Monte Carlo inference in robotics, variational inference in machine learning, and Markov chain Monte Carlo inference in statistics. A key problem faced by practitioners is measuring the accuracy of an approximate infe…
Paper compresses ViTs models by 60% with minimal accuracy loss.
We show how effective-potential path-integrals methods, stemming on a simple and nice idea originally due to Feynman and successfully employed in Physics for a variety of quantum thermodynamics applications, can be used to develop an accurate and easy-to-compute semi-analytical approximation of transition probabilities…
We develop a framework for approximating collapsed Gibbs sampling in generative latent variable cluster models. Collapsed Gibbs is a popular MCMC method, which integrates out variables in the posterior to improve mixing. Unfortunately for many complex models, integrating out these variables is either analytically or co…
The paper presents an approximate formula for European mortgage options pricing.
In this paper, we study random subsampling of Gaussian process regression, one of the simplest approximation baselines, from a theoretical perspective. Although subsampling discards a large part of training data, we show provable guarantees on the accuracy of the predictive mean/variance and its generalization ability.…
Group-invariant neural networks improve approximation accuracy for symmetric functions.
We present an approximation scheme for support vector machine models that use an RBF kernel. A second-order Maclaurin series approximation is used for exponentials of inner products between support vectors and test instances. The approximation is applicable to all kernel methods featuring sums of kernel evaluations and…
The importance of accurate recommender systems has been widely recognized by academia and industry. However, the recommendation quality is still rather low. Recently, a linear sparse and low-rank representation of the user-item matrix has been applied to produce Top-N recommendations. This approach uses the nuclear nor…
We develop a dual-control method for approximating investment strategies in incomplete environments that emerge from the presence of trading constraints. Convex duality enables the approximate technology to generate lower and upper bounds on the optimal value function. The mechanism rests on closed-form expressions per…
We derive asymptotic expansions for the prices of a variety of European and barrier-style claims in a general local-stochastic volatility setting. Our method combines Taylor series expansions of the diffusion coefficients with an expansion in the correlation parameter between the underlying asset and volatility process…
This paper develops fundamental limits of deep neural network learning by characterizing what is possible if no constraints are imposed on the learning algorithm and on the amount of training data. Concretely, we consider Kolmogorov-optimal approximation through deep neural networks with the guiding theme being a relat…
The -NN graph has played a central role in increasingly popular data-driven techniques for various learning and vision tasks; yet, finding an efficient and effective way to construct -NN graphs remains a challenge, especially for large-scale high-dimensional data. In this paper, we propose a new approach to const…
iMOCA optimizes multiple objectives with continuous approximations for resource efficiency.
We study the finite horizon Merton portfolio optimization problem in a general local-stochastic volatility setting. Using model coefficient expansion techniques, we derive approximations for the both the value function and the optimal investment strategy. We also analyze the `implied Sharpe ratio' and derive a series a…
Paper improves tensor approximation for streaming data.