:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Szyfelbein, Michał, Dereniowski, Dariusz
Format:	Preprint
Published:	2026
Subjects:	Data Structures and Algorithms Machine Learning
Online Access:	https://arxiv.org/abs/2602.21312
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Constant-Factor Approximation for the Uniform Decision Tree
by: Szyfelbein, Michał
Published: (2026)

Min-Sum Set Cover on Parallel Machines
by: Szyfelbein, Michał
Published: (2026)

A Framework for Searching in Graphs in the Presence of Errors
by: Dereniowski, Dariusz, et al.
Published: (2018)

Average Case Graph Searching in Non-Uniform Cost Models
by: Szyfelbein, Michał
Published: (2026)

Polylogarithmic Approximation for Covering and Connecting Multi-Interface Networks
by: Szyfelbein, Michał, et al.
Published: (2026)

Noisy (Binary) Searching: Simple, Fast and Correct
by: Dereniowski, Dariusz, et al.
Published: (2021)

Approximating the Average-Case Graph Search Problem with Non-Uniform Costs
by: Szyfelbein, Michał
Published: (2025)

Searching in trees with $k$-up-modular cost functions
by: Szyfelbein, Michał
Published: (2025)

On multidimensional generalization of binary search
by: Dereniowski, Dariusz, et al.
Published: (2024)

Building a Nest by an Automaton
by: Czyzowicz, Jurek, et al.
Published: (2019)

Low-degree spanning trees of $2$-edge-connected graphs in linear time
by: Dereniowski, Dariusz, et al.
Published: (2024)

A Simple Approximation Algorithm for Optimal Decision Tree
by: Zhuo, Zhengjia, et al.
Published: (2025)

Learning Small Decision Trees with Few Outliers: A Parameterized Perspective
by: Gahlawat, Harmender, et al.
Published: (2025)

Guessing Efficiently for Constrained Subspace Approximation
by: Bhaskara, Aditya, et al.
Published: (2025)

Efficient Calibration for Decision Making
by: Gopalan, Parikshit, et al.
Published: (2025)

Calibration Error for Decision Making
by: Hu, Lunjia, et al.
Published: (2024)

Smooth Calibration and Decision Making
by: Hartline, Jason, et al.
Published: (2025)

Faster Low-Rank Approximation and Kernel Ridge Regression via the Block-Nyström Method
by: Garg, Sachin, et al.
Published: (2025)

Deterministic Policies for Constrained Reinforcement Learning in Polynomial Time
by: McMahan, Jeremy
Published: (2024)

Minimum Cost Adaptive Submodular Cover
by: Al-Thani, Hessa, et al.
Published: (2022)

Decision-Theoretic Approaches for Improved Learning-Augmented Algorithms
by: Angelopoulos, Spyros, et al.
Published: (2025)

Theoretically Grounded Pruning of Large Ground Sets for Constrained, Discrete Optimization
by: Nath, Ankur, et al.
Published: (2024)

A Dynamic Algorithm for Weighted Submodular Cover Problem
by: Banihashem, Kiarash, et al.
Published: (2024)

Searching in trees with monotonic query times
by: Dereniowski, Dariusz, et al.
Published: (2024)

Superconstant Inapproximability of Decision Tree Learning
by: Koch, Caleb, et al.
Published: (2024)

Arithmetical Binary Decision Tree Traversals
by: Zhang, Jinxiong
Published: (2022)

$O(\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization
by: Vaze, Rahul, et al.
Published: (2025)

Active Learning for Decision Trees with Provable Guarantees
by: Moakhar, Arshia Soltani, et al.
Published: (2026)

Constructing Decision Trees from Data Streams
by: Pham, Huy, et al.
Published: (2024)

Anytime-Constrained Reinforcement Learning
by: McMahan, Jeremy, et al.
Published: (2023)

Fair Submodular Cover
by: Chen, Wenjing, et al.
Published: (2024)

Accelerating Power Method with Fast Sketching for Stronger Low-Rank Approximation
by: Chenakkod, Shabarish, et al.
Published: (2026)

Constrained and Composite Sampling via Proximal Sampler
by: Dang, Thanh, et al.
Published: (2026)

Polynomial-Time Approximability of Constrained Reinforcement Learning
by: McMahan, Jeremy
Published: (2025)

Optimal Bounds for Adversarial Constrained Online Convex Optimization
by: Ferreira, Ricardo N., et al.
Published: (2025)

Gradient-Free Method for Heavily Constrained Nonconvex Optimization
by: Shi, Wanli, et al.
Published: (2024)

On Computing Optimal Tree Ensembles
by: Komusiewicz, Christian, et al.
Published: (2023)

On the Power of Learning-Augmented Search Trees
by: Chen, Jingbang, et al.
Published: (2022)

Distributed Least Squares in Small Space via Sketching and Bias Reduction
by: Garg, Sachin, et al.
Published: (2024)

Query-decision Regression between Shortest Path and Minimum Steiner Tree
by: Tong, Guangmo, et al.
Published: (2024)