Paper tackles conditional expectation estimation using compactification operators.
problem Estimating conditional expectations from product of two random variables.
method Operator theoretic approach using kernel integral operators in reproducing kernel Hilbert space.
result Solutions allow numerical approximation and convergence of data-driven implementations.
Verifies regularity for conditional expectation operators and embeddings, simplifying validation.
problem Characterizing when conditional expectation operators map between function spaces.
method Establishes a verifiable sufficient condition for bounded and Hilbert-Schmidt mappings based on conditional density regularity.
result Averifiable condition for mapping properties of conditional expectation operators simplifies validation.
Derives backward differentiation for Bermudan product valuation.
problem Valuation of Bermudan products using conditional expectation.
method Three properties for backward differentiation of algorithms with conditional expectation.
result Clean and simple implementation of backward differentiation.
Researchers approximate conditional expectation operators using kernel methods.
problem Statistical approximation of conditional expectation operators under minimal assumptions.
method Modifying the domain of the operator, approximating it by Hilbert-Schmidt operators in a reproducing kernel Hilbert space.
result The nonparametric estimate of the operator converges to a specific limiting object.
We establish some subprincipal estimates for Berezin-Toeplitz operators on symplectic compact manifolds. From this, we construct a family of subprincipal symbol maps and we prove that these maps are the only ones satisfying some expected conditions.
The article analyzes LCE in Hilbert space, deriving new formulas and regularisation methods.
problem Analyzing conditional expectation in infinite-dimensional Hilbert space.
method Establishing analytical properties and regularisation for LCE in Hilbert space, deriving new formulas.
result Simple derivation and intuitive justification of conditional mean embedding formula.
Paper introduces R-conditioning for risk-averse valuation in financial markets.
problem Risk-averse valuation in incomplete financial markets.
method Introduces R-conditioning as a new operator between conditional expectation and sublinear expectation.
result R-conditioning can approximate sublinear expectations and is used to compute risk-averse values.
This study optimizes energy storage scheduling under price uncertainty, balancing risk and reward.
problem Optimizing energy storage operation under price uncertainty and risk.
method Two-stage stochastic risk-constrained approach using conditional value-at-risk.
result Increasing risk aversion leads to substantial benefits in terms of risk reduction and expected reward.
This paper solves a coinsurance problem using fuzzy numbers and expected utility operators.
problem Formulating a coinsurance problem in the possibilistic setting of expected utility operators.
method Developed a framework using expected utility operators to model risk aversion and solve the coinsurance problem.
result Various formulas for the optimal T-coinsurance rate are derived for specific utility functions and fuzzy numbers. Proximal splitting methods solve rank-constrained convex problems locally.
problem Solving optimization problems with rank constraints.
method Proximal splitting algorithms with conditions on rank constraint convex envelopes.
result Proximal splitting methods converge locally to solutions under convex relaxation conditions.
Abstract: A possibilistic portfolio choice problem using expected utility operators.
problem A possibilistic portfolio choice problem in the framework of expected utility operators.
method Using expected utility operators, the paper formulates a possibilistic choice problem and derives two approximate calculation formulas for optimization.
result Two approximate calculation formulas for optimization of possibilistic portfolio choice problem.
Defines new operations on random sets in Banach spaces.
problem Assessing multivariate risks in mathematical finance.
method Introduces conditional core and convex hull operations for random sets.
result Generalised conditional expectation is sandwiched between conditional core and convex hull.
Researchers prove Weyl laws for Schrödinger operators on noncompact manifolds.
problem Proving Weyl laws for Schrödinger operators on noncompact manifolds.
method Heat kernel asymptotics, Karamata-Hardy-Littlewood Tauberian theorem, and semiclassical analysis.
result Established both classical and semiclassical Weyl laws for Schrödinger operators on noncompact manifolds.
DO-EM framework for quantum models improves generative tasks.
problem Lack of Expectation-Maximization framework for density operators.
method Demonstrated inequality for density operators, derived DO-EM framework.
result DO-EM framework outperforms probabilistic models in generative tasks.
Neural network predicts electrochemical cell faults with 53% less error.
problem Predicting faults in electrochemical cells to avoid safety hazards and reduce costs.
method Self-supervised encoder-decoder neural network that learns degradation from operating conditions.
result Predicted voltage with 53% less error than parametric models, 64% faster fault prediction.
Researchers add random metrics to data models to enable operations.
problem Lack of meaningful operations in learned low-dimensional representations.
method Endow latent space of generative models with a random Riemannian metric.
result Derived tight error bounds on expected distances in deterministic approximations.
Study of unitary and groupoid orbits of normal operators, focusing on manifold structures and spectral conditions.
problem Understanding the manifold structures of orbits of normal operators under different norm topologies.
method Unified treatment of unitary and groupoid orbits, using moment maps and conditional expectations.
result Differentiable structures for orbits and necessary spectral conditions for norm closure and submanifold properties.
New algorithm solves composite optimization problems with unknown expectations.
problem Solving composite optimization problems with unknown statistical expectations.
method Proposes a new stochastic primal-dual algorithm for composite optimization problems with unknown statistical expectations.
result Converges to a saddle point of the Lagrangian function.
Study optimizes learning rates for conditional mean embedding estimates.
problem Consistency of kernel ridge regression for conditional mean embedding.
method Adaptive statistical learning rate derived for misspecified setting.
result Upper bound matches optimal O(logn/n) rates without assuming finite dimensionality. FKEE estimates expectations without samples, using diffusion bridges and PINNs.
problem Estimating expectations without large sample sizes.
method Diffusion bridge models and Feynman-Kac operator approximation using PINNs.
result Significantly reduces variance and improves efficiency.
We analyze the size of the dictionary constructed from online kernel sparsification, using a novel formula that expresses the expected determinant of the kernel Gram matrix in terms of the eigenvalues of the covariance operator. Using this formula, we are able to connect the cardinality of the dictionary with the eigen…
We study conditions on the topological D-branes of types A and B obtained by requiring a proper matching of the spectral flow operators on the boundary. These conditions ensure space-time supersymmetry and stability of D-branes. In most cases, we reproduce the results of Marino-Minasian-Moore-Strominger, who studied th…
A new EM framework for goal-conditioned RL improves performance on sparse reward tasks.
problem Handling sparse rewards in goal-conditioned reinforcement learning.
method A graphical model framework with an EM algorithm that includes a learning-in-hindsight E-step and a supervised M-step.
result hEM significantly outperforms model-free baselines on goal-conditioned benchmarks with sparse rewards.
We present a new multiparameter resolvent trace expansion for elliptic operators, polyhomogeneous in both the resolvent and auxiliary variables. For elliptic operators on closed manifolds the expansion is a simple consequence of the parameter dependent pseudodifferential calculus. As an additional nontrivial toy exampl…
This paper develops a Bayesian optimal design of experiments for estimating the statistical expectation of a black-box function.
problem Estimating the statistical expectation of a black-box function in complex systems.
method Sequentially querying the black-box function at specific designs selected by an infill-sampling criterion, maximizing expected information gain.
result Derivation of a semi-analytic mathematical formula for expected information gain about the statistical expectation of a physical response.
DeepONet learns operators for PDEs with varying parameters and initial conditions.
problem Learning operators for partial differential equations with different parameters or initial conditions.
method DeepONet uses a Branch net and Trunk net to minimize error between evaluated and expected outputs, incorporating a scalar auxiliary variable approach for energy dissipation.
result DeepONet can accurately approximate operators for PDEs with varying parameters or initial conditions.
Efficiently predicts long-time dynamics of quantum spin models using MLP regression.
problem Challenges in calculating long-time expectation values for quantum spin models.
method Utilized a multi-layer perceptron (MLP) model for regression on matrix product states (MPS) expectation values.
result Significantly reduced computational cost for generating long-time dynamics while maintaining high accuracy.
The operator realizing a Dehn twist in quantum Teichmuller theory is diagonalized and continuous spectrum is obtained. This result is in agreement with the expected spectrum of conformal weights in quantum Liouville theory at c>1. The completeness condition of the eigenvectors includes the integration measure which app…
Insider trading is reduced when penalized, affecting expected penalties in a non-monotone way.
problem Reducing insider trading behavior when insiders face legal penalties.
method Characterized via a backward stochastic differential equation (BSDE) with a non-linear operator.
result The insider's expected penalties are non-monotone in the fee structure and determined by relative entropy.
Develops a new deep learning formulation using Mori-Zwanzig formalism.
problem Improves deep learning by introducing a new concept of memory.
method Uses Mori-Zwanzig formalism to propagate quantities of interest through neural networks.
result Rigorously transforms deep networks into shallow ones using decay property of memory operator.
New method for predicting portfolio dynamics using non-Euclidean geometry.
problem Predicting efficient portfolios with geometric structure.
method Non-Euclidean conditional expectation and filtering equations.
result Accurate numerical forecasts of portfolio dynamics.
Introduces a new conditional expectation under distorted probabilities, addressing time-inconsistency.
problem Time-inconsistency in nonlinear expectations under probability distortion.
method Localizes probability distortion and constructs a time-consistent conditional expectation.
result Constructs a conditional expectation that is time-consistent and corresponds to a parabolic differential equation.
Proposes data-driven methods for estimating conditional expectations.
problem Estimating conditional expectations when underlying density is unknown.
method Data-driven techniques to directly estimate conditional expectations from training data.
result Extends data-driven method to solve nonlinear equations in stochastic optimization.
Covariance is shown as a commutator in random variable calculus.
problem Expressing covariance as a commutator of operators.
method Demonstrated through commutator identities involving expectations and products of functions.
result Revealed the underlying Lie algebraic structure in efficient influence curve calculus.
Model for operational risk using bipartite graphs and heavy-tailed distributions.
problem Capturing event type and business line structure in operational risk data.
method Statistical model based on heavy-tailed distributions and bipartite graphs.
result Reliable estimates of tail risk and capital allocations with small data sets.
The paper tackles domain generalization using functional regression.
problem Learning a model that generalizes well across different source distributions.
method Functional regression approach to learn a linear operator between marginal and conditional distributions.
result The proposed algorithm achieves finite sample error bounds for the idealized risk.
In portfolio optimization problems, the minimum expected investment risk is not always smaller than the expected minimal investment risk. That is, using a well-known approach from operations research, it is possible to derive a strategy that minimizes the expected investment risk, but this strategy does not always resu…
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.
We propose to learn a kernel-based message operator which takes as input all expectation propagation (EP) incoming messages to a factor node and produces an outgoing message. In ordinary EP, computing an outgoing message involves estimating a multivariate integral which may not have an analytic expression. Learning suc…
Study optimizes insurance investment to maximize utility across all capital levels.
problem Maximizing expected utility across all capital levels in an insurance company's investment strategy.
method Dynamic Programming Principle and Hamilton-Jacobi-Bellman (HJB) equation to prove existence of optimal strategy.
result Existence of optimal investment strategy proven under certain conditions.
Develop a framework for barycentric projections of optimal transport plans on Riemannian manifolds.
problem Optimal transport couplings are probabilistic objects, while many learning pipelines require deterministic maps.
method Develop a framework for barycentric projections of transport couplings on Riemannian manifolds.
result The intrinsic projection maps each source point to the conditional Fréchet mean of its destination law and is shown to be the best deterministic representative under squared geodesic loss.
For a linear combination of random variables, fix some confidence level and consider the quantile of the combination at this level. We are interested in the partial derivatives of the quantile with respect to the weights of the random variables in the combination. It turns out that under suitable conditions on the join…
Decision-calibrated prediction sets improve power system operations by reducing unnecessary costs.
problem Balancing operating costs and reliability in power systems with renewable uncertainty.
method Learn conditional prediction sets as sub-level sets of norm-based score functions, calibrate uncertainty sets based on reliability of downstream decisions.
result Decision-calibrated sets lead to more efficient operations with smaller uncertainty sets and lower costs compared to standard coverage-based calibration.
Study calculates tail risk for various mixture distributions.
problem Estimating tail risk for complex distribution mixtures.
method Analyzes tail conditional expectation for location-scale mixtures of elliptical distributions.
result Developed methods for calculating tail risk in various distributions.
Develops hyperfinite G-expectation theory for continuous-time processes.
problem Creating a discrete model for continuous-time G-expectation. method Introduces hyperfinite G-expectation and develops its theory, proving existence of liftings. result Establishes existence theorem for liftings of continuous-time G-expectation. Neural networks improve Bermudan option pricing accuracy.
problem Pricing Bermudan options with conditional expectation challenges.
method Neural network approximations of conditional expectations.
result Longstaff and Schwartz algorithm convergence with neural networks.
CEP improves inference efficiency and accuracy by conditional moment matching.
problem Intractable moment matching in EP.
method Conditional expectation propagation (CEP) performs conditional moment matching and expectation.
result CEP achieves better inference quality and efficiency.
Novel approach for estimating conditional expectations using Bayesian quadrature.
problem Estimating conditional expectations with costly evaluations.
method Probabilistic numerical methods incorporating prior smoothness knowledge.
result Fast convergence rate and uncertainty quantification.