Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,694 papers · 148 categories

Trend · papers per month

2565127681,024 · Jun 202019922001200920172026
48 results for worst-case generation

Worst-Case Sensitivity measures model sensitivity to uncertainty set size.

problem Model sensitivity to uncertainty set size in Distributionally Robust Optimization.
method Introducing Worst-Case Sensitivity as a measure of model sensitivity, and deriving closed-form expressions for various uncertainty sets.
result DRO solutions can be sensitive to the family and size of the uncertainty set, and worst-case sensitivity reflects these properties.

Framework for worst-case generation using Wasserstein space optimization.

problem Evaluating robustness and stress-testing systems under distribution shifts.
method Min-max optimization over continuous probability distributions in Wasserstein space.
result Global convergence guarantees for the proposed Gradient Descent Ascent scheme.

The paper analyzes worst-case distortion risk metrics and weighted entropy under partial information.

problem Analyzing worst-case distortion risk metrics and weighted entropy with limited information.
method General distributions, partial information (mean and variance), various entropies and risk measures.
result Provides worst-case results for distortion risk metrics and weighted entropy.

Study approximates worst-case stock trading under uncertainty, quantifying sensitivity.

problem Maximizing worst-case cost of stock gains and losses under uncertainty.
method Approximates worst-case problem by baseline problem as uncertainty vanishes.
result Value of worst-case problem equals baseline value plus correction term.

Paper improves worst-case regret bounds for RLSVI in reinforcement learning.

problem Minimizing regret in reinforcement learning with randomized value functions.
method Introduces a clipping variant of Thompson Sampling for RLSVI.
result Achieves a ildeO(H2SAT) ilde{\mathrm{O}}(H^2S\sqrt{AT}) worst-case regret bound.

Robust hypothesis testing designs a test for worst-case distributions using kernel methods.

problem Design a robust test for hypothesis testing under uncertainty sets.
method Data-driven uncertainty sets constructed using kernel mean embeddings and maximum mean discrepancy (MMD). Bayesian and Neyman-Pearson settings investigated.
result Proposed robust kernel tests are exponentially consistent and asymptotically optimal.

The paper refines and generalizes worst-case law invariant convex risk measures.

problem Developing robust convex risk measures under uncertainty sets.
method Generalizing closed forms for worst-case law invariant convex risk measures with uncertainty sets based on norms and moment constraints.
result Explicit closed forms for convex risk measures are developed and assessed through numerical simulations.

Optimizes bond portfolios to avoid worst-case losses.

problem Finding the worst-case value of a bond portfolio over a range of yield curves and spreads.
method Solves a convex-concave saddle point optimization problem to find the worst-case value and construct a robust portfolio.
result Constructs a bond portfolio that includes the worst-case value, ensuring robustness against market uncertainties.

New framework improves worst-case generalization bounds for stochastic optimization.

problem Challenges in providing generalization guarantees for stochastic optimization algorithms.
method Introduces random set stability and empirically relevant complexity measures to avoid intractable mutual information terms.
result Bounded worst-case generalization error in terms of random set stability and empirically relevant complexity measures.

This paper calculates worst-case target semi-variances for uncertain losses.

problem Managing risk when loss distribution is uncertain and only partial information is known.
method Derives worst-case target semi-variances for symmetric or non-negative losses under uncertainty sets representing investor's undesirable scenarios.
result Closed-form expressions for worst-case target semi-variances are derived.

We design a general framework for answering adaptive statistical queries that focuses on providing explicit confidence intervals along with point estimates. Prior work in this area has either focused on providing tight confidence intervals for specific analyses, or providing general worst-case bounds for point estimate…

2019-06-21abs ↗pdf ↗

The study assesses how financial networks resist simultaneous price shocks and calculates the worst-case loss.

problem Resilience of financial networks to simultaneous price fluctuations and default contagion.
method Introduced a concept of default resilience margin, ε*, and computed worst-case systemic loss through linear programming.
result Threshold value ε* determines the maximum amplitude of asset price fluctuations the network can tolerate.

This paper analyzes how randomizing rewards in MBRL can improve performance without being overly optimistic.

problem The gap between theoretical worst-case regret analysis and empirical performance in MBRL.
method Reward randomization in model-based reinforcement learning (MBRL) with kernelized linear regulator (KNR) model.
result Reward randomization guarantees partial optimism and near-optimal worst-case regret.

New framework identifies worst-case shifts for predictive resource allocation models.

problem Identifying harmful shifts in predictive models for resource allocation.
method Hierarchical model structure and submodular optimization for worst-case loss.
result Empirical evidence shows divergent worst-case shifts identified by different metrics.

Proposes a new framework for balancing average- and worst-case performance in machine learning.

problem Robustness issues in machine learning, especially in safety-critical domains.
method Probabilistic robustness framework that balances average- and worst-case performance.
result Effective algorithm balances average- and worst-case performance with lower computational cost.

MaxMatch improves SSL with worst-case consistency for better generalization.

problem Efficiently supervised learning with unlabeled data.
method Worst-case consistency regularization for SSL, providing a bound and an algorithm.
result The proposed method converges to a stationary point and improves generalization.

Bandits with Knapsacks (BwK) is a general model for multi-armed bandits under supply/budget constraints. While worst-case regret bounds for BwK are well-understood, we present three results that go beyond the worst-case perspective. First, we provide upper and lower bounds which amount to a full characterization for lo…

2020-02-01abs ↗pdf ↗

Study on proper learning under relaxed worst-case robust loss for VC classes.

problem Proper adversarially robust PAC learning under relaxed worst-case robust loss.
method Introduced a family of robust loss relaxations and showed their effectiveness for proper learnability.
result VC classes are properly PAC learnable with sample complexity close to standard PAC learning setup.

Paper tackles robust online learning with worst-case distributions.

problem Distributionally robust online learning with worst-case Wasserstein ambiguity sets.
method Formulated as an online saddle-point stochastic game, proposed a general framework converging to robust Nash equilibrium.
result Proposed a tailored algorithm for piecewise concave loss functions, achieving substantial speedups.

Options are generally learned by using an inaccurate environment model (or simulator), which contains uncertain model parameters. While there are several methods to learn options that are robust against the uncertainty of model parameters, these methods only consider either the worst case or the average (ordinary) case…

2019-05-22abs ↗pdf ↗

Given a task of predicting YY from XX, a loss function LL, and a set of probability distributions ΓΓ on (X,Y)(X,Y), what is the optimal decision rule minimizing the worst-case expected loss over ΓΓ? In this paper, we address this question by introducing a generalization of the principle of maximum entropy. Applying t…

2016-06-07abs ↗pdf ↗

Paper proves higher-order flow matching preserves optimality in generative modeling.

problem Theoretical guarantees for higher-order flow matching in generative modeling.
method Neural network approximations with controlled depth, width, and sparsity.
result Proves worst case optimality for second-order flow matching.

Efficient learning of minimax risk classifiers in high dimensions.

problem Efficient learning of classifiers in high-dimensional data.
method Iterative algorithm leveraging constraint generation methods for minimax risk classifiers.
result The algorithm provides efficient learning and feature selection in high-dimensional scenarios.

SRO optimizes decisions against worst-case sampler induced by generative models.

problem Operational uncertainty shifts from explicit probability law to sampler induced by learned generators.
method SRO optimizes decisions against the worst-case sampler induced by perturbing the learned generator.
result Empirical worst-case objective provides high-probability upper certificate for true population objective.

The paper introduces a new measure of robustness for partially identifiable risks.

problem Achieving robustness when the robust risk is only partially identified.
method Introduces the worst-case robust risk and evaluates existing methods.
result Existing robustness methods are suboptimal in the partially identifiable case.

By treating the financial market as a thermodynamic system, we establish a one-to-one correspondence between thermodynamic variables and economic quantities. Measured by the expected loss under the worst-case scenario, financial risk caused by model uncertainty is regarded as a result of the interaction between financi…

2019-03-30abs ↗pdf ↗

Worst-case bounds on the expected shortfall risk given only limited information on the distribution of the random variables has been studied extensively in the literature. In this paper, we develop a new worst-case bound on the expected shortfall when the univariate marginals are known exactly and additional expert inf…

2017-01-16abs ↗pdf ↗

The paper tackles adversarial robustness by maximizing worst-case mutual information.

problem Training robust machine learning models against adversarial inputs is challenging.
method Develops a notion of representation vulnerability and an unsupervised learning method to maximize worst-case mutual information.
result Proves a lower bound on minimum adversarial risk and supports robustness of representations.

The study assesses external validity by evaluating worst-case treatment effects across subpopulations.

problem Underrepresentation of marginalized groups and limited study populations.
method Develops a semiparametrically efficient estimator for worst-case treatment effects (WTE) and uses cross-fitting to guard against brittle findings.
result The proposed framework guards against invalid findings due to unanticipated population shifts.

Hardness proof for agnostically learning halfspaces from worst-case lattice problems.

problem Agnostically learning halfspaces in the presence of noise.
method Reduction to worst-case lattice problems (GapSVP, SIVP).
result No efficient algorithm can achieve misclassification error better than 1/2 - γ under given hardness assumptions.

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…

2015-07-20abs ↗pdf ↗

Study evaluates approaches to improve worst-case model performance across patient subpopulations.

problem Improving model accuracy for specific patient subpopulations.
method Comparison of distributionally robust optimization (DRO) and standard learning procedures.
result Standard learning procedures generally outperform DRO approaches for improving model performance across subpopulations.