Study calculates Bayes risk for semi-supervised learning with uncertain labels.
problem Uncertain labeling in semi-supervised classification.
method Gaussian mixture model, Bayes risk computation, comparison with algorithm performance.
result New insights into semi-supervised learning algorithm performance.
Paper shows hard computational limits for invariant causal prediction.
problem Hard computational limits for invariant causal prediction.
method Distributionally robust estimator with ellipse-shaped uncertain set.
result Estimation error rate can be arbitrarily slow for computationally efficient algorithms.
Paper proposes online optimization for uncertain systems using machine learning and DRO.
problem Optimization of uncertain dynamical systems with distributional uncertainty.
method Combines machine learning with Distributional Robust Optimization (DRO) to handle uncertainty.
result Online solutions with probabilistic regret bounds for uncertain systems.
New algorithm for reinforcement learning in uncertain environments with unknown thresholds.
problem Safety in reinforcement learning in unknown and uncertain environments.
method Growing-Window estimator sampling and Stochastic Pessimistic-Optimistic Thresholding (SPOT) algorithm.
result Achieves sublinear regret and constraint violation of i l d e O ( T ) ilde{\mathcal{O}}(\sqrt{T}) i l d e O ( T ) . New method for analyzing elliptic and parabolic equations.
problem Analyzing elliptic and parabolic equations.
method Level set version of partial uniform ellipticity.
result Effective approach to investigate equations.
A method for accurate pricing of multidimensional derivatives under uncertain volatility.
problem High-dimensional stochastic control problem in uncertain volatility model.
method Backward actor-critic stochastic policy gradient scheme combining DP, PPO, and neural networks.
result Accurate and efficient pricing of multidimensional derivatives compared to benchmarks.
The paper tackles robust control with uncertain dependence using data-driven methods.
problem Nonparametric robust control under dependence uncertainty in multi-period stochastic systems.
method Nonparametric adaptive robust control framework using stochastic gradient descent ascent algorithm.
result The controller benefits from knowing more about the uncertain model.
New method recovers signals from noisy indirect data, even when noise is uncertain.
problem Recovering signals from indirect observations with uncertain noise.
method Polyhedral estimates, incorporating convex optimization.
result Presumably good estimates can be constructed for ellitope signal sets.
Bayesian Gaussian process models handle uncertain data locations in PDE approximations.
problem Handling uncertainties in data locations for PDE approximations.
method Bayesian inference of uncertain inputs integrated into Gaussian process predictions.
result Substantial reduction in predictive uncertainties achieved through Bayesian inference.
DRO optimizes decisions under uncertain distributions, considering worst-case scenarios.
problem Optimizing decisions when the distribution of uncertainties is itself uncertain.
method Defines ambiguity sets and seeks decisions optimal under the worst-case distribution.
result DRO models can be connected to regularization techniques and machine learning.
The paper tackles mean-variance analysis in Bayesian optimization under uncertainty.
problem Optimizing decisions in uncertain environments considering trade-offs between average and variance of risk.
method Developed bounds for mean and variance risk measures in Gaussian Process models and proposed AL algorithms for multi-task, multi-objective, and constrained optimization scenarios.
result Proposed AL algorithms effectively address the mean-variance trade-off in uncertain optimization scenarios.
The paper explores how to handle uncertain evidence in probabilistic models.
problem Handling uncertain evidence in probabilistic models and stochastic simulators.
method The paper considers distributional evidence, Jeffrey's rule, and virtual evidence as methods for interpreting uncertain evidence.
result The paper provides guidelines on how to account for uncertain evidence and highlights the importance of careful consideration.
New method calculates Shapley values for uncertain functions.
problem Uncertain value functions in explainable machine learning.
method Definition of Shapley values using probability theory.
result Shapley values can be applied to uncertain functions.
IDT learns human preferences from uncertain decisions, even when humans are suboptimal.
problem Learning human preferences from uncertain and suboptimal decisions.
method Inverse decision theory (IDT) framework, statistical analysis of IDT, characterizing sample complexity.
result Learning preferences is easier when decisions are more uncertain, even if humans are suboptimal.
Study on learning strategies in matching markets with uncertain preferences.
problem Decision-making in scarcity of shared resources with unknown agent preferences.
method Representation of preferences in a reproducing kernel Hilbert space, learning algorithm for uncertainty.
result Optimal strategies derived to maximize agents' expected payoffs, with stability and fairness properties.
Paper defines invariants for elliptic Weyl groups and connects them to Frobenius structures.
problem Defining invariants for elliptic Weyl groups.
method Defines a set of good basic invariants and shows their connection to Frobenius structures.
result Good basic invariants give flat invariants and structure constants of Frobenius structures.
The paper studies degenerate and nonlocal elliptic operators on Poincaré-Einstein manifolds.
problem Understanding the singular sets of degenerate and nonlocal elliptic operators on Poincaré-Einstein manifolds.
method Developing quantitative differentiation theory, stratification, Minkowski estimates, and ε-regularity results.
result Uniform Hausdorff measure estimates for the singular sets of degenerate/singular elliptic operators.
In this paper, within the framework of uncertainty theory, the valuation of equity warrants is investigated. Different from the methods of probability theory, the equity warrants pricing problem is solved by using the method of uncertain calculus. Based on the assumption that the firm price follows an uncertain differe…
New method optimizes resource allocation for uncertain tasks.
problem Optimal resource allocation for uncertain tasks with limited capacity.
method Formulated as an assignment problem, optimized using learning to rank with net discounted cumulative gain.
result Achieves higher expected profit and precision compared to classification methods.
Novel algorithms for online learning with uncertain feedback graphs reduce regret.
problem Uncertainty in feedback graphs hinders traditional online learning approaches.
method Developed novel online learning algorithms to handle uncertain feedback graphs.
result Proved sublinear regret under mild conditions for the proposed algorithms.
Quantum methods model uncertain volatility in financial markets.
problem Modeling financial asset prices with uncertain volatility.
method Quantum stochastic calculus with unitary and non-unitary time evolution.
result Different volatility levels encoded in quantum states, leading to varied market price evolutions.
New model predicts dynamic volatility in uncertain financial markets.
problem Predicting dynamic volatility in financial markets with uncertainty.
method Generalized Barndorff-Nielsen and Shephard (BN-S) model considering delay and fuzziness.
result Effective prediction of dynamic volatility with improved performance.
The target of this paper is to consider model the risky asset price on the financial market under the Knightian uncertainty, and pricing the ask and bid prices of the uncertain risk. We use the nonlinear analysis tool, i.e., G-frame work [26], to construct the model of the risky asset price and bid-ask pricing for the …
New algorithm minimizes worst-case regret in uncertain, time-varying dynamics.
problem Model-based policy learning in uncertain, time-varying dynamics.
method Planning regret metric and iterative algorithm for minimizing it.
result Empirical evidence shows the proposed algorithm outperforms existing methods.
We use copulas to improve SLAM in uncertain environments.
problem Uncertain data association and nonlinear transition models in SLAM.
method Integrate copulas into a Sequential Monte Carlo estimator for SLAM.
result Our method effectively handles SLAM in uncertain environments.
Bayesian optimisation (BO) has been a successful approach to optimise functions which are expensive to evaluate and whose observations are noisy. Classical BO algorithms, however, do not account for errors about the location where observations are taken, which is a common issue in problems with physical components. In …
New Kelvin transform for anisotropic elliptic problems.
problem Semilinear and quasilinear anisotropic elliptic problems.
method Introducing a new Kelvin-type transform in the anisotropic setting.
result New insights into anisotropic elliptic problems.
SOLBP extends efficient inference to uncertain Bayesian networks.
problem Inference in uncertain Bayesian networks with second-order probabilities.
method Extends Loopy Belief Propagation to second-order Bayesian networks.
result Generates inferences consistent with sum-product networks, more efficient and scalable.
Federated learning (FL) is a distributed learning approach where a set of end-user devices participate in the learning process by acting on their isolated local data sets. Here, we process local data sets of users where worst-case optimization theory is used to reformulate the FL problem where the impact of local data …
New algorithm for uncertain time series classification.
problem Uncertainty in time series data.
method Uncertain dissimilarity measure based on Euclidean distance and uncertain shapelet transform.
result Effectiveness of the uncertain shapelet transform algorithm on state-of-the-art datasets.
Characterizes stably elliptic elements in Lie groups and their properties.
problem Understanding stably elliptic elements in Lie groups and their geometric and algebraic properties.
method Characterization through fixed point algebra and Weyl group action; relates to maximal invariant cones and compactness of order intervals.
result Connected components of stably elliptic elements can be described using Weyl group action on a compactly embedded Cartan subalgebra.
Study robust utility maximization with uncertain continuous semimartingales.
problem Maximizing utility in continuous time under model uncertainty.
method Duality and conjugate problems for logarithmic, exponential, and power utilities.
result Existence of optimal portfolios for various utilities.
Flexible framework integrates machine learning and DRO for uncertain parameter prediction.
problem Limited joint observations of uncertain parameters and covariates.
method Wasserstein, sample robust optimization, and phi-divergence-based ambiguity sets.
result Validation of theoretical and practical benefits in limited data scenarios.
Solves super-hedging for financial models with uncertain prices.
problem Super-hedging European or Asian options in discrete-time models with uncertain prices.
method Numerical procedure under AIP condition to compute infimum price.
result Solves super-hedging problem under weak no-arbitrage condition.
Elliptical processes extend Gaussian models with heavier tails.
problem Regression and classification with non-Gaussian likelihoods or heavy tails.
method Spline normalizing flow for variational inference of elliptical distributions.
result Elliptical processes outperform Gaussian processes in non-Gaussian settings.
The paper addresses portfolio allocation with uncertain covariance matrices, finding a logarithmic risk dependence.
problem Portfolio allocation with uncertain covariance matrices.
method Calculates the expected value of CARA utility function over a distribution of covariance matrices, considering uncertainty in future returns and covariances.
result Marginalization introduces a logarithmic dependence on risk, leading to lower allocation levels for higher uncertainties.
Optimal option portfolios under Sharpe Ratio maximization with skew-elliptical t-distributed returns
problem Optimal option portfolios under Sharpe Ratio maximization
method Formulation for explicit portfolio weights
result Different optimal portfolios for Sharpe Ratio and return-to-Value-at-Risk (VaR) ratio
Paper develops a fair pricing algorithm for dynamic settings with uncertain demand.
problem Fair pricing in dynamic, uncertain demand scenarios.
method Contextual bandit algorithm with dynamic pricing and demand learning.
result Achieves optimal regret bound with fairness constraints.
Study the relationship between canonical polynomials and elliptic sequences for elliptic singularities.
problem Understanding the relationship between canonical polynomials and elliptic sequences for elliptic singularities.
method An inductive setup of elliptic germs and comparison of their canonical polynomials.
result The exponents of the canonical polynomial determine the elliptic sequence and vice versa under certain conditions.
Elliptical processes generalize Gaussian and Student-t models with fat tails and computational efficiency.
problem Need for models with fat tails and computational tractability.
method Represent elliptical distributions as continuous mixtures of Gaussian distributions, derive closed-form expressions for marginal and conditional distributions.
result Elliptical processes offer advantages in robust regression compared to Gaussian processes.
Bayesian method for estimating inputs leading to specific probability outputs.
problem Estimating inputs for specific probability outputs of uncertain functions.
method Bayesian strategy using Gaussian process modeling and SUR principle.
result Surpassed performance of existing methods through numerical experiments.
Framework for games with uncertain parameters, ensuring no player can improve by changing strategy.
problem Non-cooperative games with globally uncertain parameters and no common prior.
method Mixed strategies and subjective priors, Extended Equilibrium defined by fixed-point argument.
result Existence of Extended Equilibrium under certain conditions.
We present a robust alternative to principal component analysis (PCA) --- called elliptical component analysis (ECA) --- for analyzing high dimensional, elliptically distributed data. ECA estimates the eigenspace of the covariance matrix of the elliptical data. To cope with heavy-tailed elliptical distributions, a mult…
Variational methods yield formulas for eigenvalues of elliptic operators, with applications to metric evolution.
problem Deriving formulas for eigenvalues of elliptic operators on compact manifolds.
method Variational methods applied to elliptic operators on compact Riemannian manifolds.
result Generic subsets of metrics yield simple spectra of elliptic operators.
Paper introduces imprecise logistic regression for handling uncertain data.
problem Uncertainties in data prevent traditional logistic regression from being applied effectively.
method Develops imprecise logistic regression model using intervals of possible values.
result Clearly expresses epistemic uncertainty in predictions.
Model quantifies uncertainty's impact on European option prices.
problem Uncertainty in market volatility risk affects option pricing.
method Hamilton-Jacobi-Bellman framework and finite element method.
result Dependence of Delta on uncertainty is nonlinear and varied.
Paper uses ML for high-dimensional option pricing under uncertain volatility model.
problem High-dimensional option pricing under uncertain volatility.
method Two ML approaches: GTU and NNU.
result Significant improvement in option pricing precision.
A functional ansatz is developed which gives certain elliptic solutions of the Witten-Dijkgraaf-Verlinde-Verlinde (or WDVV) equation. This is based on the elliptic trilogarithm function introduced by Beilinson and Levin. For this to be a solution results in a number of purely algebraic conditions on the set of vectors …