PAC-Bayesian bounds for stochastic LTI systems derived.
problem Error bounds for stochastic LTI systems.
method PAC-Bayesian theory applied to autonomous stochastic LTI models.
result Error bounds for stochastic LTI systems derived.
Improved price bounds for multi-asset derivatives using market option data.
problem Creating robust price bounds for multi-asset derivatives under market-implied dependence.
method Extracting inter-asset dependence information from market option prices and applying modified martingale optimal transport.
result Improved price bounds for multi-asset derivatives, demonstrating relevance and tractability.
The paper analyzes risk estimation methods and derives bounds for OCE risk.
problem Estimating the Optimized Certainty Equivalent (OCE) risk from samples.
method Derives mean-squared error and concentration bounds for SAA of OCE, and analyzes an efficient stochastic approximation-based estimator.
result Finite sample bounds and mis-identification probability bounds for the efficient estimator.
Study dynamic trading in options to improve price bounds for exotic derivatives.
problem Improving price bounds for exotic derivatives through dynamic option trading.
method Extend semi-static trading strategies to include dynamic option trading, analyze duality results and pricing rules.
result Improved price bounds for exotic derivatives compared to conventional methods.
We derive bounds for a notion of adversarial risk, designed to characterize the robustness of linear and neural network classifiers to adversarial perturbations. Specifically, we introduce a new class of function transformations with the property that the risk of the transformed functions upper-bounds the adversarial r…
Sharp bounds on heat kernel derivatives on incomplete manifolds.
problem Extending bounds on heat kernel derivatives to incomplete Riemannian manifolds.
method Analyzing heat kernels on incomplete Riemannian manifolds with conservative and non-conservative vector fields.
result Sharp bounds on all orders of heat kernel derivatives are established for incomplete manifolds.
Estimates for covariant derivatives and Riesz transforms on differential forms.
problem Bounding covariant derivatives and Riesz transforms on differential forms.
method Use Bismut derivative formula to prove heat kernel bounds and Riesz transform boundedness.
result Formulate and prove conjecture on boundedness of covariant local Riesz-transforms in L^p.
Enhanced H-consistency bounds derived under relaxed conditions.
problem Quantifying the relationship between zero-one estimation error and surrogate loss estimation error.
method Relaxing the condition on the surrogate loss conditional regret and presenting a general framework for establishing enhanced H-consistency bounds. result Derivation of more favorable H-consistency bounds in various scenarios. New bounds on continuous random variables' right-tail probabilities.
problem Finding precise upper and lower limits for right-tail probabilities of continuous random variables.
method Developed new bounds based on PDF, first derivative, and two parameters.
result The new bounds are tight for various continuous random variables.
Data-driven models are subject to model errors due to limited and noisy training data. Key to the application of such models in safety-critical domains is the quantification of their model error. Gaussian processes provide such a measure and uniform error bounds have been derived, which allow safe control based on thes…
Paper derives an error bound for stochastic LTI systems.
problem Stochastic LTI systems with inputs in control engineering and econometrics.
method PAC-Bayesian-Like error bound derivation.
result Derived an error bound for stochastic LTI systems.
Sharp bounds derived for eigenvalues on specific geometric spaces.
problem Eigenvalue problems on asymptotically hyperbolic manifolds and submanifolds.
method Sharp bounds derived for three types of eigenvalue problems: p-Dirichlet, polyharmonic, and weakly Poincaré-Einstein. result Sharp bounds and their implications for asymptotic sectional curvatures and mean curvature.
The study examines how including additional call option prices affects model-independent price bounds for exotic derivatives.
problem Improving model-independent price bounds for exotic derivatives using additional call option prices.
method Characterization of market settings that guarantee improved price bounds and exclusion of any improvement.
result The inclusion of additional call option prices can significantly impact model-independent price bounds.
Improved bounds for Monte Carlo Rademacher Averages using self-bounding functions.
problem Proving sharper concentration bounds for MCERA.
method Deriving new bounds through self-bounding functions and concentration of measure.
result Novel bounds depend on data-dependent quantities, improving over standard methods.
In this note, Black--Scholes implied volatility is expressed in terms of various optimisation problems. From these representations, upper and lower bounds are derived which hold uniformly across moneyness and call price. Various symmetries of the Black--Scholes formula are exploited to derive new bounds from old. These…
Study on signatures of positive braids with bounds derived.
problem Understanding signatures of positive braids and their invariants.
method Derived lower bounds for Levine-Tristram signatures, and upper and lower bounds on signature ratios.
result Established bounds on signatures of positive braids, uniformly valid across monoids.
Paper derives PAC-Bayesian bounds for LTI systems learning from empirical data.
problem Characterizing predictive power of LTI systems learned from data.
method PAC-Bayesian bounds for LTI stochastic dynamical systems with inputs.
result Finite-sample error bounds for learning algorithms of LTI systems.
Entropy study on synthetic spaces with curvature bounds.
problem Entropy functional on synthetic spaces with curvature bounds.
method Rigorous justification of entropy formula, monotonicity, and rigidity properties; heat kernel bounds.
result Bounds for heat equation solutions on synthetic spaces.
In this note, we obtain the asymptotic estimate for the time derivative of the Φ-entropy in terms of the lower bound on the Bakry-Emery Γ2 curvature. In the cases of Hyperbolic space and Heisenberg group, we show that the time derivative of the Φ-entropy is non-increasing, and we also get sharp asymptotic bound …
Theory for deep neural network approximation of score function and its derivatives.
problem Handling data distributions with low-dimensional structure and unbounded support.
method Simultaneous approximation of the score function and its derivatives using deep neural networks.
result Approximation error bounds match literature but relax bounded support requirement.
We use surrogate losses to obtain several new regret bounds and new algorithms for contextual bandit learning. Using the ramp loss, we derive new margin-based regret bounds in terms of standard sequential complexity measures of a benchmark class of real-valued regression functions. Using the hinge loss, we derive an ef…
In this paper we study a model-based approach to calculating approximately optimal policies in Markovian Decision Processes. In particular, we derive novel bounds on the loss of using a policy derived from a factored linear model, a class of models which generalize numerous previous models out of those that come with s…
Logistic regression gets a new, simpler uniform bound.
problem Finding a uniform bound for logistic regression's empirical risk.
method PAC-Bayes approach with second-order expansion and Rademacher-complexity bounds.
result Provides a dimension-free uniform concentration bound.
Sharp bounds derived for test error of finite-rank kernel ridge regression.
problem Loose bounds on test error for finite-rank kernels in machine learning.
method Sharp non-asymptotic upper and lower bounds for KRR test error.
result Tighter bounds on finite-rank KRR test error, valid for any regularization parameters.
New method uses logical relations to derive bounds and inequality constraints from causal models.
problem Recovering bounds and inequality constraints from unobserved confounding.
method Using rules of probability and restrictions on counterfactuals implied by causal graphical models.
result Powerful method to recover known and novel bounds and constraints.
Sharp bounds for curve isoperimetric deficit derived.
problem Finding sharp bounds for the isoperimetric deficit of curves.
method Fourier analysis applied to derive Wirtinger-type inequalities.
result Sharp lower and upper bounds for the isoperimetric deficit proved.
Exact bounds derived for neural network outputs with noisy inputs.
problem Bounding the output distribution of neural networks with random inputs.
method Applying ReLU NNs to derive bounds for general NNs, then using these to find exact error guarantees.
result Exact upper and lower bounds for the output distribution of neural networks with random inputs.
In this paper, we propose a novel uniform generalization bound on the time and inverse temperature for stochastic gradient Langevin dynamics (SGLD) in a non-convex setting. While previous works derive their generalization bounds by uniform stability, we use Rademacher complexity to make our generalization bound indepen…
We derive a lower bound on the size of finite non-cyclic quotients of the braid group that is superexponential in the number of strands. We also derive a similar lower bound for nontrivial finite quotients of the commutator subgroup of the braid group.
New bounds derived using conditional f-information for machine learning models.
problem Improving generalization bounds in machine learning.
method Introducing novel information-theoretic generalization bounds via conditional f-information. result Derives generalization bounds applicable to both bounded and unbounded loss functions.
We develop a technique for deriving data-dependent error bounds for transductive learning algorithms based on transductive Rademacher complexity. Our technique is based on a novel general error bound for transduction in terms of transductive Rademacher complexity, together with a novel bounding technique for Rademacher…
Kernel smoothing on unknown manifolds with bounds and asymptotic normality.
problem Data on unknown manifolds without boundaries.
method Finite sample bounds and asymptotic normality for kernel smoothing and its derivatives.
result Established finite sample bounds and asymptotic normality for kernel smoothing.
Unified derivation of PAC-Bayes and MI bounds for general VC classes with fast rates.
problem Generalization bounds for machine learning models with VC classes.
method Unified derivation of conditional PAC-Bayesian and mutual information bounds, including MAC-Bayesian bounds.
result Nontrivial bounds for general VC classes and faster rates for specific conditions.
Derivatives on the Chicago Board Options Exchange volatility index (VIX) have gained significant popularity over the last decade. The pricing of VIX derivatives involves evaluating the square root of the expected realised variance which cannot be computed by direct Monte Carlo methods. Least squares Monte Carlo methods…
Unified framework for deriving generalization bounds in supervised learning.
problem Generalization error bounds in supervised learning.
method Data Processing Inequality PAC-Bayesian framework.
result Unified bounds on binary Kullback-Leibler generalization gap for various divergences.
We suggest a general oracle-based framework that captures different parallel stochastic optimization settings described by a dependency graph, and derive generic lower bounds in terms of this graph. We then use the framework and derive lower bounds for several specific parallel optimization settings, including delayed …
We derive and analyze learning algorithms for apprenticeship learning, policy evaluation, and policy gradient for average reward criteria. Existing algorithms explicitly require an upper bound on the mixing time. In contrast, we build on ideas from Markov chain theory and derive sampling algorithms that do not require …
We consider the problem of learning a dictionary matrix from a number of observed signals, which are assumed to be generated via a linear model with a common underlying dictionary. In particular, we derive lower bounds on the minimum achievable worst case mean squared error (MSE), regardless of computational complexity…
We consider option pricing in a regime-switching diffusion market. As the market is incomplete, there is no unique price for a derivative. We apply the good-deal pricing bounds idea to obtain ranges for the price of a derivative. As an illustration, we calculate the good-deal pricing bounds for a European call option a…
Derives exact formula for Minkowski sum of ellipsoids in N-space.
problem Finding volume bounds for Minkowski sum of ellipsoids.
method Closed-form parametric equation derivation and volume bounds calculation.
result Upper and lower volume bounds for Minkowski sum of ellipsoids.
New bounds derived for KG algorithm's performance in finite time.
problem Best arm identification problem in multi-armed bandit.
method Theoretical analysis of finite-time performance, deriving bounds for sample allocation, error probability, and regret.
result Upper and lower bounds for the probability of error and simple regret of the KG algorithm.
We present a general method for deriving collapsed variational inference algo- rithms for probabilistic models in the conjugate exponential family. Our method unifies many existing approaches to collapsed variational inference. Our collapsed variational inference leads to a new lower bound on the marginal likelihood. W…
We study the K-armed dueling bandit problem, a variation of the standard stochastic bandit problem where the feedback is limited to relative comparisons of a pair of arms. The hardness of recommending Copeland winners, the arms that beat the greatest number of other arms, is characterized by deriving an asymptotic regr…
Develops a framework for consistent pricing of interest rate derivatives.
problem Consistent pricing of bivariate interest rate exotics across interconnected markets.
method Schrödinger optimal transport problem with constraints.
result Demonstrates practical applicability and no-arbitrage bounds computation.
The paper establishes bounds for transductive learning using information theory.
problem Transductive learning generalization gap control.
method Information theory, PAC-Bayes, mutual information, conditional mutual information, different information measures.
result Established transductive information-theoretic and PAC-Bayesian bounds.
The paper derives upper bounds on eigenvalues of Laplace-Beltrami operator on hyperbolic surfaces.
problem Finding upper bounds on eigenvalues of Laplace-Beltrami operator on hyperbolic surfaces.
method Using spectral decompositions and consistency conditions derived from quadruple overlap integrals in terms of triple overlap integrals.
result Derives upper bounds on eigenvalues, nearly saturated by the Bolza surface.
Derives gradient bounds for f-heat equations on manifolds with Bakry-Emery Ricci curvature.
problem Gradient estimates for positive solutions of f-heat equations on manifolds with specific curvature conditions.
method Applies Li-Yau gradient estimates to positive solutions of the f-heat equation on closed manifolds with Bakry-Emery Ricci curvature bounded below.
result Derives Li-Yau gradient bounds for positive solutions of the f-heat equation.
We give a unified statement and proof of a class of wellknown mean value inequalities for nonnegative functions with a nonlinear bound on the Laplacian. We generalize these to domains with boundary, requiring a (possibly nonlinear) bound on the normal derivative at the boundary. These inequalities give rise to an energ…