Paper improves confidence intervals and variance estimation for deep learning models.
problem Improving confidence intervals and variance estimation in deep learning models.
method Residual-based framework for conditional variance estimation; robust bootstrap procedure for confidence intervals.
result First non-asymptotic bounds for variance estimation using ReLU networks.
A novel k-NN method estimates conditional mean and variance efficiently.
problem Joint estimation of conditional mean and variance.
method Integrates k-NN with automated variance selection.
result Achieves fast convergence rates and improved precision.
New bounds show BBVI's gradient variance matches SGD conditions, improving parameterization efficiency.
problem Understanding and improving the convergence of black-box variational inference (BBVI).
method Showed BBVI satisfies matching gradient variance bounds corresponding to the ABC condition for smooth and quadratically-growing log-likelihoods.
result Proven BBVI's gradient variance matches SGD conditions, with superior dimensional dependence for mean-field parameterization.
New framework tests mean-variance spanning in high dimensions.
problem Testing mean-variance spanning in high-dimensional asset spaces.
method Robust Student-t statistic based on batch-mean method, combined using Cauchy combination test.
result Advantages of diversification vary by economic conditions and cross-country.
Study shows exponential error reduction in multiclass classification without bias-variance trade-off.
problem Multiclass classification with margin conditions.
method Analysis of classification error under hard-margin conditions.
result Exponential decrease in classification error without bias-variance trade-off.
New method uses machine learning to improve statistical inference.
problem Performing inference on conditional functionals with scarce labeled data.
method Combines localization with prediction-based variance reduction.
result Valid and sharp confidence intervals for conditional functionals.
Efficiently designs experiments without integrating posterior distributions.
problem Computational inefficiency in Bayesian experimental design for PDE-based models.
method Likelihood-free approach using ANN to approximate conditional expectation.
result Significant reduction in observation model evaluations.
Off-policy policy estimators that use importance sampling (IS) can suffer from high variance in long-horizon domains, and there has been particular excitement over new IS methods that leverage the structure of Markov decision processes. We analyze the variance of the most popular approaches through the viewpoint of con…
Normal distributions ensure asymptotic variance reduction in moment matching Monte Carlo.
problem Asymptotic variance reduction in general integration problems.
method Characterization of conditions for asymptotic variance reduction using normal distributions.
result Asymptotic variance reduction is guaranteed for normal distributions in moment matching Monte Carlo.
We quantify predictive uncertainty using the posterior predictive variance.
problem Quantifying uncertainty in predictive models.
method Using the law of total variance, we generate expansions for the posterior predictive variance.
result Identify the main contributors to prediction intervals and quantify term-wise uncertainty.
Hutch++ optimizes trace estimation for generative models, reducing variance and improving quality.
problem High variance and scalability issues in Hutchinson estimators for generative models.
method Hutch++ is an optimal stochastic trace estimator designed to minimize training variance while maintaining transport optimality.
result Hutch++ leads to higher quality generations and effective variance reduction in various applications.
Efficiently simulates SABR model with novel sampling methods.
problem Sampling integrated variance and terminal forward price in SABR model.
method Moment-matched shifted lognormal approximation for integrated variance, CEV approximation for terminal forward price.
result Enhanced simulation scheme is highly efficient, accurate, and reliable.
New unbiased gradient estimators for complex optimization problems.
problem Unbiased and variance-limited gradient estimation for conditional stochastic optimization.
method Developed multilevel Monte Carlo gradient estimators for conditional stochastic optimization problems.
result Unbiased and finite variance gradient estimators for conditional stochastic optimization problems.
The weak variance-alpha-gamma process is a multivariate Lévy process constructed by weakly subordinating Brownian motion, possibly with correlated components with an alpha-gamma subordinator. It generalises the variance-alpha-gamma process of Semeraro constructed by traditional subordination. We compare three calibrati…
MeanFlow training is unstable due to misusing conditional velocity, leading to variance issues.
problem Unstable training of MeanFlow due to variance problems.
method Theoretical analysis and derivation of optimal coefficient in closed form.
result The optimal coefficient in MeanFlow training minimizes variance but not necessarily quality.
We study the problem of empirical minimization for variance-type functionals over functional classes. Sharp non-asymptotic bounds for the excess variance are derived under mild conditions. In particular, it is shown that under some restrictions imposed on the functional class fast convergence rates can be achieved incl…
Optimal regression with reject option using conditional variance thresholding.
problem Regression with reject option to handle uncertain predictions.
method Derive optimal rule based on thresholding conditional variance, semi-supervised estimation using labeled and unlabeled data.
result The predictor with reject option is almost as good as the optimal predictor in terms of risk and rejection rate.
In the paper, we consider three quadratic optimization problems which are frequently applied in portfolio theory, i.e, the Markowitz mean-variance problem as well as the problems based on the mean-variance utility function and the quadratic utility.Conditions are derived under which the solutions of these three optimiz…
Investigates portfolio optimization with and without gearing constraints.
problem Improving portfolio weights for better alignment with expected returns.
method Extends the alpha-weight angle bound to include gearing constraints and uses theoretical arguments and simulations.
result Equally weighted portfolios are not preferable to mean-variance portfolios even with poor forecast ability and a badly conditioned covariance matrix.
SAPPHIRE tackles ill-conditioned rERM problems with faster convergence.
problem Ill-conditioned objectives and non-smooth regularizers in rERM.
method Sketch-based preconditioning and scaled proximal mapping.
result Achieves condition-number-free linear convergence.
Conditional Leibniz Derivative Estimation reduces variance in stochastic models.
problem Estimating derivatives in stochastic models with discontinuous sample performance.
method Combining push-out likelihood ratio method with Leibniz integral rules.
result Conditional Leibniz estimator reduces variance and is easy to implement.
Neural SDEs reduce variance in stochastic simulations.
problem Efficiency of Monte Carlo simulations in finance.
method Use neural SDEs with control variates parameterized by neural networks.
result Prove optimality conditions for variance reduction in SDEs with infinite activity.
Ensembles improve classifier performance by reducing bias, not variance.
problem Improving classifier performance through ensemble methods.
method Extended bias-variance decomposition for classification tasks, introducing dual reparameterization.
result Ensembling reduces bias in classifiers, contrary to the traditional view.
We develop a conditional sampling scheme for pricing knock-out barrier options under the Linear Transformations (LT) algorithm from Imai and Tan (2006). We compare our new method to an existing conditional Monte Carlo scheme from Glasserman and Staum (2001), and show that a substantial variance reduction is achieved. W…
New algorithms improve distributed optimization under mild variance conditions.
problem Improving distributed optimization for large-scale machine learning problems.
method Revisited Federated Averaging and SCAFFOLD algorithms under a general variance condition.
result Established convergence results for smooth nonconvex objective functions under mild variance conditions.
The study identifies conditions for algorithms to have tight generalization bounds.
problem Understanding which algorithms have tight generalization bounds.
method Analyzing conditions that preclude tight generalization bounds and identifying stable algorithms.
result Stable algorithms have tight generalization bounds, while unstable ones do not.
In stochastic volatility models based on time-homogeneous diffusions, we provide a simple necessary and sufficient condition for the discretely sampled fair strike of a variance swap to converge to the continuously sampled fair strike. It extends Theorem 3.8 of Jarrow, Kchia, Larsson and Protter (2013) and gives an aff…
In the continuous time mean-variance model, we want to minimize the variance (risk) of the investment portfolio with a given mean at terminal time. However, the investor can stop the investment plan at any time before the terminal time. To solve this kind of problem, we consider to minimize the variances of the investm…
The paper estimates variance of random sections on complex manifolds.
problem Estimating variance of random holomorphic sections on compact Kahler manifolds.
method Analyzes a sequence of smooth Hermitian holomorphic line bundles on a compact Kahler manifold X, considering specific probability measures.
result Provides variance estimates for various measures including Gaussian and Fubini-Study measures.
Paper learns DAGs with quadratic variance functions efficiently.
problem Learning DAGs with quadratic variance functions.
method Introduces topological layers to reconstruct DAGs hierarchically.
result Efficient algorithm reduces computational cost.
New method reduces variance in Bayesian inverse problems.
problem High variance in Monte Carlo estimates for inverse problems.
method Conditional neural control variates based on Stein's identity.
result Substantial variance reduction across different inverse problems.
The discrete-time mean-variance portfolio selection formulation, a representative of general dynamic mean-risk portfolio selection problems, does not satisfy time consistency in efficiency (TCIE) in general, i.e., a truncated pre-committed efficient policy may become inefficient when considering the corresponding trunc…
New algorithm for contextual combinatorial bandits with probabilistic arm triggering.
problem Optimizing decisions in dynamic environments with probabilistic arm availability.
method C^2-UCB-T and VAC^2-UCB algorithms with TPM and VM conditions.
result Achieved improved regret bounds for contextual combinatorial bandits.
A new QHR model extends HR model with a quadratic variance function.
problem Modeling volatility with greater flexibility and stationarity.
method Introducing a quadratic variance function to the HR model, maintaining Markovian property.
result Stationary distribution of the QHR model is Pearson type IV.
VarGrad reduces variance in ELBO gradient estimation for variational inference.
problem Improving the variance of gradient estimators in variational inference.
method VarGrad uses a new log-variance loss to estimate the ELBO gradient, achieving lower variance than the score function method.
result VarGrad offers a lower variance gradient estimator compared to other methods.
The paper develops a method for self-normalized inference in adaptive experiments.
problem Adaptive experiments require a fixed horizon for ATE estimation, but propensities can change.
method The method uses self-normalized martingale limit theory to estimate ATE.
result The Studentized statistic is asymptotically N(0,1) at the prespecified horizon.
The posterior variance of Gaussian processes is a valuable measure of the learning error which is exploited in various applications such as safe reinforcement learning and control design. However, suitable analysis of the posterior variance which captures its behavior for finite and infinite number of training data is …
New algorithm reduces MDP regret by accounting for state suboptimality gaps and variance.
problem Reducing regret in episodic MDPs with varying state suboptimality gaps.
method Introduced MVP algorithm with variance-aware gap-dependent regret bound.
result Achieved a variance-aware gap-dependent regret bound for MDPs.
Jackknife variance estimation validated for generalized U-statistics.
problem Uncertainty quantification for subsampling-based estimators.
method Jackknife variance estimation for generalized U-statistics with row-wise Lr weak law. result Jackknife and delete-d variance estimators are ratio-consistent for generalized U-statistics. We study the fair strike of a discrete variance swap for a general time-homogeneous stochastic volatility model. In the special cases of Heston, Hull-White and Schobel-Zhu stochastic volatility models we give simple explicit expressions (improving Broadie and Jain (2008a) in the case of the Heston model). We give condi…
New method optimizes portfolio weights as functions, outperforming traditional approaches.
problem Optimizing portfolio weights in mean-variance models.
method Functional optimization approach, treating weights as functions of past values.
result Gradient-ascent algorithms can solve functional optimization problems for mean-variance portfolio management.
This paper investigates optimal portfolio strategies in a financial market where the drift of the stock returns is driven by an unobserved Gaussian mean reverting process. Information on this process is obtained from observing stock returns and expert opinions. The latter provide at discrete time points an unbiased est…
New algorithm reduces optimization complexity in adaptive mirror descent.
problem Optimizing complex, non-smooth, non-convex functions efficiently.
method SVRAMD: Variance Reduced Adaptive Mirror Descent.
result Variance reduction accelerates convergence in adaptive mirror descent.
This paper is devoted to pricing American options using Monte Carlo and the Malliavin calculus. Unlike the majority of articles related to this topic, in this work we will not use localization fonctions to reduce the variance. Our method is based on expressing the conditional expectation E[f(St)/Ss] using the Malliavin…
Optimizes deep neural network initialization variance for better performance.
problem Improving deep neural network performance through optimal initialization variance.
method Using SGD dynamics and Fokker-Planck equations, we study the relationship between initialization and expected loss function.
result An optimal condition for initialization variance that leads to lower training loss and higher test accuracy.
OSIRIS reduces variance in off-policy evaluation by omitting irrelevant states.
problem High variance in importance sampling-based OPE estimators.
method OSIRIS reduces variance by omitting likelihood ratios associated with states irrelevant to return.
result OSIRIS is unbiased and has lower variance than ordinary importance sampling.
Transformer-based models overfit financial time series data, leading to increased prediction variance.
problem Forecast collapse of transformer-based models under squared loss in financial time series.
method Theoretical analysis and numerical experiments on high-frequency EUR/USD exchange rate data.
result Increased model expressivity in Transformer-based models leads to spurious fluctuations without reducing bias, resulting in higher prediction variance.
Paper introduces a new identifiability criterion for DAGs using conditional variances.
problem Challenges in discovering causal relationships from observational data.
method Introduces a novel identifiability criterion for DAGs using conditional variances. Uses weak majorization on Cholesky factor of covariance matrix for learning DAGs.
result Demonstrates effectiveness of the new approach in recovering DAGs through simulations and real data analysis.