English

Competitive learning of monotone Boolean functions

Data Structures and Algorithms 2014-02-03 v1 Computational Complexity Optimization and Control
Authors: Sascha Kurz
View on arXiv ↗ PDF ↗

Abstract

We apply competitive analysis onto the problem of minimizing the number of queries to an oracle to completely reconstruct a given monotone Boolean function. Besides lower and upper bounds on the competitivity we determine optimal deterministic online algorithms for the smallest problem instances.

Keywords

online algorithm optimization algorithm boolean functions

Cite

@article{arxiv.1401.8135,
  title  = {Competitive learning of monotone Boolean functions},
  author = {Sascha Kurz},
  journal= {arXiv preprint arXiv:1401.8135},
  year   = {2014}
}

Comments

5 pages, 2 figures, presented at APMOD 2012

Related papers

View all related →
Data Structures and Algorithms · Computer Science
Competitive Boolean Function Evaluation: Beyond Monotonicity, and the Symmetric Case
Ferdinando Cicalese, Travis Gagie, Eduardo Laber, Martin Milanic
2014-02-11
Data Structures and Algorithms · Computer Science
Online Bounded Analysis
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen +1
2017-06-14
Data Structures and Algorithms · Computer Science
Dueling Optimization with a Monotone Adversary
Avrim Blum, Meghal Gupta, Gene Li, Naren Sarayu Manoj +2
2023-11-21
Computer Science and Game Theory · Computer Science
Learning-Augmented Online Bidding in Stochastic Settings
Spyros Angelopoulos, Bertrand Simon
2025-10-30
Performance · Computer Science
Competitive Online Optimization with Multiple Inventories: A Divide-and-Conquer Approach
Qiulin Lin, Yanfang Mo, Junyan Su, Minghua Chen
2022-02-08
Machine Learning · Computer Science
Competitive on-line learning with a convex loss function
Vladimir Vovk
2007-05-23
Machine Learning · Computer Science
Metrical Task Systems with Online Machine Learned Advice
Kevin Rao
2021-09-30
Machine Learning · Computer Science
Black-box Methods for Restoring Monotonicity
Evangelia Gergatsouli, Brendan Lucier, Christos Tzamos
2020-03-24
Data Structures and Algorithms · Computer Science
The Pareto Frontier of Randomized Learning-Augmented Online Bidding
Mathis Degryse, Imrane Saakour, Christoph Dürr, Spyros Angelopoulos
2026-05-15
Data Structures and Algorithms · Computer Science
A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio
Elisabeth Günther, Olaf Maurer, Nicole Megow, Andreas Wiese
2012-11-01
Data Structures and Algorithms · Computer Science
A Comparison of Performance Measures via Online Search
Joan Boyar, Kim S. Larsen, Abyayananda Maiti
2015-03-19
Performance · Computer Science
Competitive Online Optimization under Inventory Constraints
Qiulin Lin, Hanling Yi, John Pang, Minghua Chen +3
2024-12-20
Optimization and Control · Mathematics
Computational bounds on randomized algorithms for online bin stretching
Antoine Lhomme, Nicolas Catusse, Nadia Brauner
2024-05-30
Machine Learning · Computer Science
Real-Time Optimisation for Online Learning in Auctions
Lorenzo Croissant, Marc Abeille, Clément Calauzènes
2020-10-21
Data Structures and Algorithms · Computer Science
Online Bin Packing with Predictions
Spyros Angelopoulos, Shahin Kamali, Kimia Shadkami
2024-04-18
Optimization and Control · Mathematics
Competitive Algorithms for Online Budget-Constrained Continuous DR-Submodular Problems
Omid Sadeghi, Reza Eghbali, Maryam Fazel
2019-07-02
Data Structures and Algorithms · Computer Science
Competitive caching with machine learned advice
Thodoris Lykouris, Sergei Vassilvitskii
2020-08-24
Machine Learning · Computer Science
Boosting Barely Robust Learners: A New Perspective on Adversarial Robustness
Avrim Blum, Omar Montasser, Greg Shakhnarovich, Hongyang Zhang
2022-02-15
Computer Science and Game Theory · Computer Science
Most Competitive Mechanisms in Online Fair Division
Martin Aleksandrov, Toby Walsh
2020-06-30
Machine Learning · Computer Science
Online Optimization with Memory and Competitive Control
Guanya Shi, Yiheng Lin, Soon-Jo Chung, Yisong Yue +1
2021-01-11
Data Structures and Algorithms · Computer Science
Competitive Query Minimization for Stable Matching with One-Sided Uncertainty
Evripidis Bampis, Konstantinos Dogeas, Thomas Erlebach, Nicole Megow +2
2024-07-16
Computational Complexity · Computer Science
Approximate degree lower bounds for oracle identification problems
Mark Bun, Nadezhda Voronova
2023-05-23
Computer Science and Game Theory · Computer Science
Dueling Algorithms
Nicole Immorlica, Adam Tauman Kalai, Brendan Lucier, Ankur Moitra +2
2011-01-17
Machine Learning · Computer Science
Decision-Focused Learning: Through the Lens of Learning to Rank
Jayanta Mandi, Víctor Bucarey, Maxime Mulamba, Tias Guns
2022-06-20
Machine Learning · Computer Science
Optimal Online Learning using Potential Functions
Yoav Freund
2022-12-08
R2 v1 2026-06-22T02:58:30.572Z