Pith. sign in

Mathematical Programming , volume=

7 Pith papers cite this work. Polarity classification is still indexing.

7 Pith papers citing it

years

2026 7

representative citing papers

On Bayesian Softmax-Gated Mixture-of-Experts Models

stat.ML · 2026-04-22 · unverdicted · novelty 7.0

Bayesian softmax-gated mixture-of-experts models achieve posterior contraction for density estimation and parameter recovery using Voronoi losses, plus two strategies for choosing the number of experts.

From Optimization to Satisficing: Robust Screening under Distributional Ambiguity

math.OC · 2026-05-18 · unverdicted · novelty 6.0

Introduces a robust satisficing model for screening under Wasserstein ambiguity that meets a revenue target by minimizing worst-case shortfall, yielding tractable randomized pricing mechanisms that enhance buyer surplus over robust optimization under increasing hazard rates.

Distributionally Robust Multi-Objective Optimization

cs.LG · 2026-05-07 · unverdicted · novelty 6.0

DR-MOO adds distributional robustness to multi-objective optimization and gives single-loop MGDA algorithms reaching epsilon-Pareto-stationary points in O(epsilon^{-4}) samples for nonconvex problems.

The Distributionally Robust Cyclic Inventory Routing Problem

math.OC · 2026-05-05 · unverdicted · novelty 6.0 · 2 refs

The authors create a distributionally robust formulation for the cyclic inventory routing problem that admits a deterministic reformulation via multi-point worst-case distributions and chance-constraint equivalents, solved by nested branch-and-price and tested on real automotive data.

Generating Plausible Stress Scenarios via Large Deviations

q-fin.RM · 2026-06-30 · unverdicted · novelty 5.0

A large-deviations method generates plausible stress scenarios for financial losses by concentrating on most likely configurations conditional on large losses, recovering stressed loss laws even with sparse data.

citing papers explorer

Showing 7 of 7 citing papers.

  • On Bayesian Softmax-Gated Mixture-of-Experts Models stat.ML · 2026-04-22 · unverdicted · none · ref 176

    Bayesian softmax-gated mixture-of-experts models achieve posterior contraction for density estimation and parameter recovery using Voronoi losses, plus two strategies for choosing the number of experts.

  • Robustness in Sequential Decision Making under Evolving Uncertainty: Evidence from High-Frequency Market Making q-fin.TR · 2026-07-09 · conditional · none · ref 5

    In high-frequency market making, action robustness (Sinkhorn regularization) dominates uncertainty tolerance in reshaping sequential quoting and inventory, while excessive robustness can cut execution opportunities in illiquid names.

  • From Optimization to Satisficing: Robust Screening under Distributional Ambiguity math.OC · 2026-05-18 · unverdicted · none · ref 36

    Introduces a robust satisficing model for screening under Wasserstein ambiguity that meets a revenue target by minimizing worst-case shortfall, yielding tractable randomized pricing mechanisms that enhance buyer surplus over robust optimization under increasing hazard rates.

  • Distributionally Robust Multi-Objective Optimization cs.LG · 2026-05-07 · unverdicted · none · ref 13

    DR-MOO adds distributional robustness to multi-objective optimization and gives single-loop MGDA algorithms reaching epsilon-Pareto-stationary points in O(epsilon^{-4}) samples for nonconvex problems.

  • The Distributionally Robust Cyclic Inventory Routing Problem math.OC · 2026-05-05 · unverdicted · none · ref 24 · 2 links

    The authors create a distributionally robust formulation for the cyclic inventory routing problem that admits a deterministic reformulation via multi-point worst-case distributions and chance-constraint equivalents, solved by nested branch-and-price and tested on real automotive data.

  • Generating Plausible Stress Scenarios via Large Deviations q-fin.RM · 2026-06-30 · unverdicted · none · ref 244

    A large-deviations method generates plausible stress scenarios for financial losses by concentrating on most likely configurations conditional on large losses, recovering stressed loss laws even with sparse data.

  • An Exact Algorithm for Mixed-Integer Bilevel Stochastic Problem math.OC · 2026-06-28 · unverdicted · none · ref 60

    Develops an exact finite-convergence algorithm for Σ₂^p-hard mixed-integer bilevel stochastic programs via extended single-level reformulation and stochastic cutting planes.