New algorithm SELECT minimizes satisficing regret in bandits.
problem Minimizing regret in bandit optimization with satisficing arms.
method SELECT algorithm for satisficing regret minimization.
result SELECT achieves constant expected satisficing regret.
Proposes a computational framework for real-time risk assessment and prioritization.
problem Real-time risk assessment and prioritization for uncertain outcomes.
method Develops a computational framework based on satisficing measure for real-time risk assessment and prioritization. Applies sample average approximation and primal-dual stochastic approximation algorithms.
result Demonstrates the effectiveness of the proposed framework in real-time risk assessment and prioritization.
Satisficing is a relaxation of maximizing and allows for less risky decision making in the face of uncertainty. We propose two sets of satisficing objectives for the multi-armed bandit problem, where the objective is to achieve reward-based decision-making performance above a given threshold. We show that these new pro…
New algorithm learns satisficing behaviors more efficiently in complex environments.
problem Intractability of optimal exploration in complex environments.
method Extends a deep reinforcement learning agent to learn satisficing policies without model-based planning.
result Demonstrates efficient learning of satisficing behaviors and optimal behaviors when feasible.
Study shows nonstationary bandits require T-dependent regret even with minimal nonstationarity.
problem Understanding satisficing regret in nonstationary multi-armed bandits.
method Developed a novel Fano-based framework for nonstationary bandits with a post-interaction reference construction.
result Optimal regret scales with T even with minimal nonstationarity, contrasting with stationary case.
New algorithm optimizes beam and rate allocation in mmWave systems for multiple users.
problem Optimizing beam and rate allocation in mmWave systems for multiple users with limited feedback.
method Introducing SAT-CTS, a combinatorial semi-bandit policy with satisficing objective.
result SAT-CTS achieves finite-time regret bounds and reduces satisficing regret in mmWave systems.
This paper analyzes statistical properties of the Robust Satisficing model.
problem Lack of statistical theory for the Robust Satisficing model.
method Comprehensive analysis of statistical properties, including confidence intervals and generalization error bounds.
result Established two-sided confidence intervals and finite-sample generalization error bounds for the RS optimizer.
Paper formalizes Simon's satisficing through FFSD, proving its equivalence to expected utility theory.
problem Formalizing Herbert Simon's bounded rationality concept in economic decision-making.
method Developed FFSD framework using Lean 4 theorem prover, proving equivalence to expected utility theory.
result Equivalence theorem linking FFSD to expected utility maximization for approximate indicator functions.
Semi-analytical approach for optimal wealth management contributions.
problem Optimizing contributions to achieve a financial goal with uncertain returns.
method Controlled backward Kolmogorov equation and Schrodinger equation solution.
result Semi-analytical solutions for efficient frontiers in control space.
New algorithms optimize decision-making under uncertainty with graph information.
problem Optimizing decisions in large, uncertain environments with graph-based similarities.
method Graph-based UcB and ζ-UcB algorithms for maximizing and satisficing.
result Proves algorithms are near-optimal and benefits from graph side information.
The paper tackles lexicographic multiarmed bandit problems with bounded regret.
problem Selecting lexicographic optimal arms in multiobjective bandit problems.
method Defining lexicographic regret, considering prior information, and proposing algorithms for both settings.
result Achieves uniformly bounded regret in time for both prior settings and sublinear gap-free regret in the prior-free case.
Formula derived for blow-up of quaternionic maps on Hyperkähler manifolds.
problem Analyzing the behavior of quaternionic maps near singularities.
method Deriving a blow-up formula for the limit of weakly converging quaternionic maps.
result A blow-up formula for the limit of quaternionic maps is derived.
The paper addresses human-like decision-making in multi-agent systems using bounded risk-sensitive Markov Games.
problem Modeling human-like decision-making in multi-agent systems with risk-seeking and loss-aversion behaviors.
method Forward policy design and inverse reward learning with iterative reasoning and cumulative prospect theory.
result The proposed algorithms demonstrate both risk-averse and risk-seeking behaviors in multi-agent systems.
New insights into optimal portfolios and ecological equilibria reveal surprising complexity.
problem Optimal portfolio construction with ecological constraints.
method Computational analysis of multispecies Lotka-Volterra equations with unit rank interaction matrices.
result Logarithm of the average number of solutions grows as \(N^{2/3}\), with most likely solutions being much smaller.
Paper argues the bear case for Bitcoin is bounded and terminal states are neutral to positive.
problem The identity of Bitcoin's creator and the associated overhang risk.
method Quantitative analysis of Satoshi's 1.148 million BTC position, considering various preference sets.
result The terminal states most consistent with observed behavior are neutral to slightly positive for Bitcoin's effective supply.
Study invariant measures on measured laminations for subgroups of mapping class group.
problem Classify invariant Radon measures on space of measured laminations for subgroups of mapping class group.
method Geometric approach, focusing on recurrent measured laminations, explicitly constructing ergodic measures.
result Show uniquely ergodic for divergence-type subgroups, generalize results for full mapping class group.
New set-valued star-shaped risk measures introduced for better risk assessment.
problem Improving risk assessment in financial contexts.
method Developed new set-valued star-shaped risk measures and proved their representation theorems.
result Set-valued star-shaped risk measures can be represented as unions of set-valued convex risk measures.
The Bergman measure converges to the Zhang measure on a hybrid space.
problem Proving convergence of Bergman measures to Zhang measure.
method Analyzing convergence on a hybrid space and metrized curve complex.
result Bergman measure converges to Zhang measure on a hybrid space.
Bayesian approach to robust risk measures under model uncertainty.
problem Representing robust risk measures as a single probability measure.
method Introducing two types of risk measures and analyzing their relation to robust risk measures.
result Robust risk measures can be represented by a mixture probability measure, a Bayesian approach.
The paper classifies 1-dimensional uniform measures in various dimensions.
problem Classifying uniformly distributed measures of dimension 1 in general codimension.
method Analyzing measures with connected 1-dimensional support and providing a partial classification for general measures.
result Uniform measures with connected 1-dimensional support are homogeneous measures.
The paper studies dynamic star-shaped risk measures and their representation.
problem Representing dynamic star-shaped risk measures and their properties.
method Representation theorems for dynamic monetary and star-shaped risk measures.
result Dynamic star-shaped risk measures can be represented as the lower envelope of a family of dynamic convex risk measures.
Introduces Star-Shaped deviation measures for risk analysis.
problem Risk measurement and analysis in finance.
method Characterizes Star-Shaped deviation measures through acceptance sets and convex deviation measures.
result Exposes the relationship between Star-Shaped risk measures and deviation measures.
Transformers can interpolate between arbitrary measures.
problem Understanding the expressive power of Transformers as measure-to-measure maps.
method Provided an explicit choice of parameters for a single Transformer to match N arbitrary input measures to N arbitrary target measures.
result A single Transformer can interpolate between arbitrary measures.
Classifies invariant measures on specific character varieties.
problem Classifying invariant probability measures on character varieties.
method Measure disintegration along transverse Lagrangian tori fibrations.
result Ergodic measures are either counting measures on finite orbits or Liouville measures.
Researchers compute the ratio between two normalizations of Thurston measure on measured laminations.
problem Computing the ratio between two normalizations of Thurston measure.
method Using the integral and symplectic structures on the space of measured laminations.
result Computed the ratio between two normalizations of Thurston measure.
Paper characterizes star-shaped risk measures and their properties.
problem Characterizing risk measures in the presence of liquidity risk and competitive delegation.
method Characterization of star-shaped risk measures, study of their properties.
result Star-shaped risk measures include all practically used risk measures.
Paper compares fairness measures and feature importance measures using SHAP.
problem Comparing fairness measures and feature importance measures.
method Focus on SHAP, a game-theoretic measure of feature importance.
result Results for unfairness-prone datasets.
New Bayesian method for spectral deconvolution with Poisson noise.
problem Estimating physical model parameters from noisy spectral data.
method Bayesian measurement framework applied to Poisson noise model.
result Clarifies relationship between measurement time and estimation limits.
Paper introduces quasi-logconvex risk measures and their properties.
problem Characterizing and understanding new risk measures.
method Characterization through dual representation and properties of acceptance sets.
result Established dual representation and taxonomy of quasi-logconvex risk measures.
Submodularity is studied for convex risk measures, including Expected Shortfall.
problem Characterizing submodularity in convex risk measures.
method Analyzing submodularity properties of law-invariant coherent risk measures, including Expected Shortfall and Value-at-Risk.
result AES is submodular only when it reduces to ES, and empirical analysis shows AES violations are less frequent than VaR and ES violations.
Paper compares graph and set partition measures for graph clustering.
problem Comparing graph clustering methods using different similarity measures.
method Introduces graph-aware partition similarity measures and compares them with set partition measures.
result Graph-aware measures provide complementary information to set partition measures.
New geometric measure simplifies complex analysis.
problem Complex geometric analysis challenges.
method Geometric integration and convergence methods.
result Smallest measure satisfying Area Formula.
The paper explores non-convex risk measures and their characterizations.
problem Characterizing non-convex risk measures without convexity or weak convexity.
method Characterizes monetary risk measures as lower envelopes of families of convex or coherent risk measures, considering law-invariance and SSD-consistency.
result Unified representation theorems for law-invariant risk measures, including VaR.
The paper calculates extreme measures in continuous time conic finance.
problem Determining valuation bounds for financial claims.
method Using dynamic spectral risk measures and estimating extreme measures from market data.
result Explicit formulas for extreme measures' Radon-Nykodim derivatives and estimation methods.
Paper characterizes monotonic mean-deviation risk measures.
problem Developing consistent risk measures from mean-deviation models.
method Applying a risk-weighting function to the deviation part of a mean-deviation model.
result Characterizes monotonic mean-deviation measures as consistent risk measures.
Introduces factor risk measures to assess risk relative to multiple factors.
problem Measuring risk relative to multiple factors.
method Introduces a double-argument mapping as a risk measure to assess risk relative to a vector of factors.
result Characterizes various types of factor risk measures including distortion, quantile, linear, and coherent measures.
Dual representations for robust risk measures and uncertainty sets.
problem Characterizing continuity of robust risk measures and their uncertainty sets.
method Develop dual representations for robust risk measures and uncertainty sets based on distinct geometric assumptions.
result Two dual frameworks for consolidated uncertainty sets are complementary, not interchangeable.
A scalable approach to learning from probability measures using quantization.
problem Efficiently comparing and manipulating large sets of probability measures.
method Quantization of probability measures to a fixed support, followed by optimal transport computations.
result Consistency and convergence guarantees for quantized measures in various OT-based tasks.
Study on measurable pseudo-Anosov maps on surfaces.
problem Characterize dynamics of pseudo-Anosov maps on surfaces.
method Analyze measurable pseudo-Anosov homeomorphisms with specific properties.
result Prove transitivity, dense periodic points, sensitivity, and ergodicity.
The Cannon-Thurston map's pushed measures on the circle are singular with respect to sphere measures.
problem Understanding the behavior of geodesics and measures on fibered hyperbolic 3-manifolds.
method Properties of geodesics and measures on the circle and sphere are analyzed to prove singularity.
result Natural measures on the circle become singular with respect to measures on the sphere.
Risk measures for multivariate financial positions are studied in a utility-based framework. Under a certain incomplete preference relation, shortfall and divergence risk measures are defined as the optimal values of specific set minimization problems. The dual relationship between these two classes of multivariate ris…
New weighted surface area measures for convex bodies with applications.
problem Generalizing surface area measures to weighted Borel measures.
method Formulating and analyzing weighted surface area measures, proving integral formula and Bézout-type inequality.
result New integral formula for mixed measure of three bodies, generalizing Bézout-type inequality.
Standardized fairness measures for continuous risk scores using Wasserstein distance.
problem Quantifying and interpreting group disparities in continuous risk scores.
method Proposes standardized fairness measures based on Wasserstein distance for continuous scores.
result Proposed measures outperform ROC-based fairness measures by being more explicit and quantifying significant biases.
Study SRB measures for Anosov actions on manifolds.
problem Characterize SRB measures for Anosov actions.
method Use Ruelle-Taylor resonances and properties of Sinai-Ruelle-Bowen measures.
result SRB measures have properties like smooth disintegrations, positive basins, and are unique under certain conditions.
We study generalizations of Reifenberg's Theorem for measures in Rn under assumptions on the Jones' β-numbers, which appropriately measure how close the support is to being contained in a subspace. Our main results, which holds for general measures without density assumptions, give effective measure bounds…
Study proposes worst+gap measure for better DG evaluation.
problem Lack of comprehensive exploration of average measure in DG evaluation.
method Introduced worst+gap measure and compared it with average measure.
result Worst+gap measure provides a more accurate approximation of true DG performance.
The study evaluates AI model performance measures for medical use.
problem Selecting appropriate performance measures for AI models in medical practice.
method Assessed 32 performance measures across five domains for binary outcomes.
result 17 measures are both proper and reflect decision-analytic performance.
We introduce a weak notion of barycenter of a probability measure μ on a metric measure space (X,d,m), with the metric d and reference measure m. Under the assumption that optimal transport plans are given by mappings, we prove that our barycenter B(μ) is well defined; it is a probability measur…