Cover Image

The Art of Being Difficult: Combining Human and AI Strengths to Find Adversarial Instances for Heuristics

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Nikoleit, Henri, Anand, Ankit, Naredla, Anurag Murty, Röglin, Heiko
Format:	Preprint
Published:	2026
Subjects:	Machine Learning Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

New Algorithms and Hardness Results for Connected Clustering
by: Eube, Jan, et al.
Published: (2025)

Effective Traveling for Metric Instances of the Traveling Thief Problem
by: Eube, Jan, et al.
Published: (2026)

Parameterized Algorithms for Computing Pareto Sets
by: Könen, Joshua, et al.
Published: (2025)

Faster Approximation Algorithms for k-Center via Data Reduction
by: Filtser, Arnold, et al.
Published: (2025)

Approximate Minimum Tree Cover in All Symmetric Monotone Norms Simultaneously
by: Kaul, Matthias, et al.
Published: (2025)

Parameterized Algorithms for the Drone Delivery Problem
by: Bartlmae, Simon, et al.
Published: (2026)

Optimal Robust Estimation under Local and Global Corruptions: Stronger Adversary and Smaller Error
by: Pittas, Thanasis, et al.
Published: (2024)

The Importance of Being Smoothly Calibrated
by: Gopalan, Parikshit, et al.
Published: (2026)

Connected k-Median with Disjoint and Non-disjoint Clusters
by: Eube, Jan, et al.
Published: (2025)

Instance-Optimal Uniformity Testing and Tracking
by: Blanc, Guy, et al.
Published: (2025)

Fast and Efficient Matching Algorithm with Deadline Instances
by: Song, Zhao, et al.
Published: (2023)

Visibility Queries in Simple Polygons
by: Bhore, Sujoy, et al.
Published: (2026)

Learning with Monotone Adversarial Corruptions
by: Larsen, Kasper Green, et al.
Published: (2026)

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

SoS Certificates for Sparse Singular Values and Their Applications: Robust Statistics, Subspace Distortion, and More
by: Diakonikolas, Ilias, et al.
Published: (2024)

Spectral Guarantees for Adversarial Streaming PCA
by: Price, Eric, et al.
Published: (2024)

Adversarial Attacks on Combinatorial Multi-Armed Bandits
by: Balasubramanian, Rishab, et al.
Published: (2023)

Adversarial Resilience in Sequential Prediction via Abstention
by: Goel, Surbhi, et al.
Published: (2023)

A Sub-Quadratic Time Algorithm for Robust Sparse Mean Estimation
by: Pensia, Ankit
Published: (2024)

Efficient Testable Learning of General Halfspaces with Adversarial Label Noise
by: Diakonikolas, Ilias, et al.
Published: (2024)

Corporate Needs You to Find the Difference: Revisiting Submodular and Supermodular Ratio Optimization Problems
by: Harb, Elfarouk, et al.
Published: (2025)

Fully Dynamic Adversarially Robust Correlation Clustering in Polylogarithmic Update Time
by: Braverman, Vladimir, et al.
Published: (2024)

Fast White-Box Adversarial Streaming Without a Random Oracle
by: Feng, Ying, et al.
Published: (2024)

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform
by: Alman, Josh, et al.
Published: (2025)

No-Regret M${}^{\natural}$-Concave Function Maximization: Stochastic Bandit Algorithms and Hardness of Adversarial Full-Information Setting
by: Oki, Taihei, et al.
Published: (2024)

Regularized Robustly Reliable Learners and Instance Targeted Attacks
by: Blum, Avrim, et al.
Published: (2024)

Instance-Optimal Quantum State Certification with Entangled Measurements
by: O'Donnell, Ryan, et al.
Published: (2025)

SoS Certifiability of Subgaussian Distributions and its Algorithmic Applications
by: Diakonikolas, Ilias, et al.
Published: (2024)

High-dimensional estimation with missing data: Statistical and computational limits
by: Verchand, Kabir Aladin, et al.
Published: (2026)

Distributionally Robust Optimization with Adversarial Data Contamination
by: Li, Shuyao, et al.
Published: (2025)

Adaptive Batch Size for Privately Finding Second-Order Stationary Points
by: Liu, Daogao, et al.
Published: (2024)

Beyond Non-Degeneracy: Revisiting Certainty Equivalent Heuristic for Online Linear Programming
by: Chen, Yilun, et al.
Published: (2025)

Information-Computation Tradeoffs for Noiseless Linear Regression with Oblivious Contamination
by: Diakonikolas, Ilias, et al.
Published: (2025)

List-Decodable Sparse Mean Estimation via Difference-of-Pairs Filtering
by: Diakonikolas, Ilias, et al.
Published: (2022)

Robust Sparse Mean Estimation via Sum of Squares
by: Diakonikolas, Ilias, et al.
Published: (2022)

Robust Sparse Estimation for Gaussians with Optimal Error under Huber Contamination
by: Diakonikolas, Ilias, et al.
Published: (2024)

Robust Regression with Adaptive Contamination in Response: Optimal Rates and Computational Barriers
by: Diakonikolas, Ilias, et al.
Published: (2026)

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

Min-CSPs on Complete Instances II: Polylogarithmic Approximation for Min-NAE-3-SAT
by: Anand, Aditya, et al.
Published: (2025)

Black-Box $k$-to-$1$-PCA Reductions: Theory and Applications
by: Jambulapati, Arun, et al.
Published: (2024)