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.
A new method debiases multiple target parameters without IFs.
Two-parameter models can learn high-dimensional targets via gradient flow.
Proposes a new method for estimating non-pathwise differentiable functional parameters.
We propose a new Bayesian tracking and parameter learning algorithm for non-linear non-Gaussian multiple target tracking (MTT) models. We design a Markov chain Monte Carlo (MCMC) algorithm to sample from the posterior distribution of the target states, birth and death times, and association of observations to targets, …
We provide non-asymptotic excess risk guarantees for statistical learning in a setting where the population risk with respect to which we evaluate the target parameter depends on an unknown nuisance parameter that must be estimated from data. We analyze a two-stage sample splitting meta-algorithm that takes as input ar…
Double descent in transfer learning explained for linear regression problems.
Bayesian active learning tackles nuisance parameters, leading to bias and dilemmas.
Recent years, transfer learning has attracted much attention in the community of machine learning. In this paper, we mainly focus on the tasks of parameter transfer under the framework of extreme learning machine (ELM). Unlike the existing parameter transfer approaches, which incorporate the source model information in…
Machine Learning (ML) algorithms have been used for assessing soil quality parameters along with non-destructive methodologies. Among spectroscopic analytical methodologies, energy dispersive X-ray fluorescence (EDXRF) is one of the more quick, environmentally friendly and less expensive when compared to conventional m…
Unsupervised domain adaptation (UDA) aims to learn the unlabeled target domain by transferring the knowledge of the labeled source domain. To date, most of the existing works focus on the scenario of one source domain and one target domain (1S1T), and just a few works concern the scenario of multiple source domains and…
We propose a simple algorithm to train stochastic neural networks to draw samples from given target distributions for probabilistic inference. Our method is based on iteratively adjusting the neural network parameters so that the output changes along a Stein variational gradient direction (Liu & Wang, 2016) that maxima…
AIS algorithm improves heavy-tailed distribution estimation.
Method aggregates models with different hyper-parameters to adapt to target domain.
We give convergence guarantees for estimating the coefficients of a symmetric mixture of two linear regressions by expectation maximization (EM). In particular, we show that the empirical EM iterates converge to the target parameter vector at the parametric rate, provided the algorithm is initialized in an unbounded co…
Improved generalization with iterative self-distillation using weighted ground-truth targets.
Investors in Target Date Funds are automatically switched from high risk to low risk assets as their retirements approach. Such funds have become very popular, but our analysis brings into question the rationale for them. Based on both a model with parameters fitted to historical returns and on bootstrap resampling, we…
Randomized methods of neural network learning suffer from a problem with the generation of random parameters as they are difficult to set optimally to obtain a good projection space. The standard method draws the parameters from a fixed interval which is independent of the data scope and activation function type. This …
This paper identifies a problem with the usual procedure for L2-regularization parameter estimation in a domain adaptation setting. In such a setting, there are differences between the distributions generating the training data (source domain) and the test data (target domain). The usual cross-validation procedure requ…
HyperVAE encodes distributions of distributions using variational inference.
ASVGD accelerates SVGD for efficient sampling from Gaussian targets.
A note on setting swap parameters for traders.
Differentially private learning avoids iterative optimization in parameter space.
We examine in this article the pricing of target volatility options in the lognormal fractional SABR model. A decomposition formula by Ito's calculus yields a theoretical replicating strategy for the target volatility option, assuming the accessibilities of all variance swaps and swaptions. The same formula also sugges…
New findings show depth is more important than width in neural networks.
In this work, a method of random parameters generation for randomized learning of a single-hidden-layer feedforward neural network is proposed. The method firstly, randomly selects the slope angles of the hidden neurons activation functions from an interval adjusted to the target function, then randomly rotates the act…
The paper investigates how target normalization and momentum affect dying ReLUs in neural networks.
Develops a direct debiased machine learning framework using Bregman divergence.
Many tasks in natural language understanding require learning relationships between two sequences for various tasks such as natural language inference, paraphrasing and entailment. These aforementioned tasks are similar in nature, yet they are often modeled individually. Knowledge transfer can be effective for closely …
Paper uses neural networks to compress large portfolios of options, reducing risk and capital requirements.
The key idea of Bayesian optimization is replacing an expensive target function with a cheap surrogate model. By selection of an acquisition function for Bayesian optimization, we trade off between exploration and exploitation. The acquisition function typically depends on the mean and the variance of the surrogate mod…
We reveal a model rank that predicts successful recovery of target functions at overparameterization.
This work evaluates PDA methods without target labels, revealing significant accuracy drops.
RTE enables extrapolation to new tasks by learning task transformations.
Bayesian transfer learning improves predictive performance with limited source data.
New method corrects bias in datasets using cumulative distribution functions.
New phases identified in neural scaling laws with compute limits.
We propose a simple algorithm to train stochastic neural networks to draw samples from given target distributions for probabilistic inference. Our method is based on iteratively adjusting the neural network parameters so that the output changes along a Stein variational gradient that maximumly decreases the KL divergen…
This paper consider penalized empirical loss minimization of convex loss functions with unknown non-linear target functions. Using the elastic net penalty we establish a finite sample oracle inequality which bounds the loss of our estimator from above with high probability. If the unknown target is linear this inequali…
Black-box variational inference tries to approximate a complex target distribution though a gradient-based optimization of the parameters of a simpler distribution. Provable convergence guarantees require structural properties of the objective. This paper shows that for location-scale family approximations, if the targ…
A scalable method for accurate inference of low-dimensional parameters in high-dimensional linear regression.
Computer model calibration typically operates by choosing parameter values in a computer model so that the model output faithfully predicts reality. By using performance targets in place of observed data, we show that calibration techniques can be repurposed to wed engineering and material design, two processes that ar…
T-BFA targets and misleads specific DNN inputs to a chosen output.
Method improves volatility targeting for index construction.
TILT improves target domain performance by penalizing an auxiliary component on unlabeled target inputs.
This work extends diffusion models to handle heavy-tailed targets, improving score estimation and sampling guarantees.
Deep learning framework predicts surface texture parameters and their uncertainties.
The use of target networks has been a popular and key component of recent deep Q-learning algorithms for reinforcement learning, yet little is known from the theory side. In this work, we introduce a new family of target-based temporal difference (TD) learning algorithms and provide theoretical analysis on their conver…
PETAL adapts models to changing target domains over time.