Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
[PDF][PDF] Concentration bounds for CVaR estimation: The cases of light-tailed and heavy-tailed distributions
Abstract Conditional Value-at-Risk (CVaR) is a widely used risk metric in applications such
as finance. We derive concentration bounds for CVaR estimates, considering separately the …
as finance. We derive concentration bounds for CVaR estimates, considering separately the …
Near-minimax-optimal distributional reinforcement learning with a generative model
M Rowland, K Li, R Munos, C Lyle… - Advances in Neural …, 2025 - proceedings.neurips.cc
We propose a new algorithm for model-based distributional reinforcement learning (RL),
and prove that it is minimax-optimal for approximating return distributions in the generative …
and prove that it is minimax-optimal for approximating return distributions in the generative …
Stochastic optimization for spectral risk measures
Spectral risk objectives–also called L-risks–allow for learning systems to interpolate
between optimizing average-case performance (as in empirical risk minimization) and worst …
between optimizing average-case performance (as in empirical risk minimization) and worst …
Risk-sensitive reinforcement learning via policy gradient search
The objective in a traditional reinforcement learning (RL) problem is to find a policy that
optimizes the expected value of a performance metric such as the infinite-horizon cumulative …
optimizes the expected value of a performance metric such as the infinite-horizon cumulative …
Learning by minimizing the sum of ranked range
S Hu, Y Ying, S Lyu - Advances in Neural Information …, 2020 - proceedings.neurips.cc
In forming learning objectives, one oftentimes needs to aggregate a set of individual values
to a single output. Such cases occur in the aggregate loss, which combines individual losses …
to a single output. Such cases occur in the aggregate loss, which combines individual losses …
Sum of ranked range loss for supervised learning
In forming learning objectives, one oftentimes needs to aggregate a set of individual values
to a single output. Such cases occur in the aggregate loss, which combines individual losses …
to a single output. Such cases occur in the aggregate loss, which combines individual losses …
Supervised learning with general risk functionals
Standard uniform convergence results bound the generalization gap of the expected loss
over a hypothesis class. The emergence of risk-sensitive learning requires generalization …
over a hypothesis class. The emergence of risk-sensitive learning requires generalization …
STL robustness risk over discrete-time stochastic processes
We present a framework to interpret signal temporal logic (STL) formulas over discrete-time
stochastic processes in terms of the induced risk. Each realization of a stochastic process …
stochastic processes in terms of the induced risk. Each realization of a stochastic process …
Pac-bayesian bound for the conditional value at risk
Abstract Conditional Value at Risk ($\textsc {CVaR} $) is a``coherent risk measure''which
generalizes expectation (reduced to a boundary parameter setting). Widely used in …
generalizes expectation (reduced to a boundary parameter setting). Widely used in …
Risk of stochastic systems for temporal logic specifications
The wide availability of data coupled with the computational advances in artificial
intelligence and machine learning promise to enable many future technologies such as …
intelligence and machine learning promise to enable many future technologies such as …