Non-adaptive stochastic score classification and explainable halfspace evaluation
From MaRDI portal
Publication:2164705
DOI10.1007/978-3-031-06901-7_21zbMath1497.90138arXiv2111.05687OpenAlexW3213206291MaRDI QIDQ2164705
Rohan Ghuge, Anupam Gupta, Viswanath Nagarajan
Publication date: 16 August 2022
Full work available at URL: https://arxiv.org/abs/2111.05687
Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (2)
Adaptivity gaps for the stochastic Boolean function evaluation problem ⋮ Algorithms for the unit-cost stochastic score classification problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Evaluation of monotone DNF formulas
- When LP is the cure for your matching woes: improved bounds for stochastic matchings
- On the adaptivity gap of stochastic orienteering
- Sequential testing of complex systems: a review
- Minimum Latency Submodular Cover
- Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
- Query strategies for priced information (extended abstract)
- A new strategy for querying priced information
- Learning with attribute costs
- Adaptivity Gaps for Stochastic Probing: Submodular and XOS Functions
- A Stochastic Probing Problem with Applications
- Approximation Algorithms for Stochastic Submodular Set Cover with Applications to Boolean Function Evaluation and Min-Knapsack
- Stochastic matching with few queries: (1-ε) approximation
- Running Errands in Time: Approximation Algorithms for Stochastic Orienteering
- Multi-armed Bandits with Metric Switching Costs
- On the competitive ratio of evaluating priced functions
This page was built for publication: Non-adaptive stochastic score classification and explainable halfspace evaluation
