Cover Image

Submodular Benchmark Selection

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Smola, Alexander
Format:	Preprint
Published:	2026
Subjects:	Artificial Intelligence Machine Learning 90C27 (Primary), 62K05, 94A17, 68T05 (Secondary) I.2.6; G.3; F.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

UniPROT: Uniform Prototype Selection via Partial Optimal Transport with Submodular Guarantees
by: Chanda, Prateek, et al.
Published: (2026)

A Fiber Criterion for Representation Identifiability in Supervised Learning
by: Sevetlidis, Vasileios
Published: (2026)

Human Supervision as an Information Bottleneck: A Unified Theory of Error Floors in Human-Guided Learning
by: Dominguez, Alejandro Rodriguez
Published: (2026)

Can Computational Reducibility Lead to Transferable Models for Graph Combinatorial Optimization?
by: Cantürk, Semih, et al.
Published: (2026)

Out-of-Distribution Detection via Channelwise Feature Aggregation in Neural Network-Based Receivers
by: Tuononen, Marko, et al.
Published: (2025)

Energy-Efficient Information Representation in MNIST Classification Using Biologically Inspired Learning
by: Stricker, Patrick, et al.
Published: (2026)

Automated but Atrophied? Student Over-Reliance vs Expert Augmentation of AI in Learning and Cybersecurity
by: Khan, Koffka
Published: (2025)

Maximizing Rollout Informativeness under a Fixed Budget: A Submodular View of Tree Search for Tool-Use Agentic Reinforcement Learning
by: Hu, Yuelin, et al.
Published: (2026)

Maximum Entropy Relaxation of Multi-Way Cardinality Constraints for Synthetic Population Generation
by: Pachet, François, et al.
Published: (2026)

Robustness, Cost, and Attack-Surface Concentration in Phishing Detection
by: Allagan, Julian, et al.
Published: (2026)

Towards a General Recipe for Combinatorial Optimization with Multi-Filter GNNs
by: Wenkel, Frederik, et al.
Published: (2024)

Iterative Exploration-Driven Sparse SDP Clustering via Thompson Sampling
by: Mun, Jongmin, et al.
Published: (2025)

Multi-level meta-reinforcement learning with skill-based curriculum
by: Yang, Sichen, et al.
Published: (2026)

The Pokémon Theorem and other Fairness Impossibility Results
by: Smola, Daniel Matsui, et al.
Published: (2026)

Generalized Maximum Entropy: When and Why you need it
by: Ferro, Giuseppe M., et al.
Published: (2025)

LOFA: Online Influence Maximization under Full-Bandit Feedback using Lazy Forward Selection
by: Xu, Jinyu, et al.
Published: (2026)

A Sufficient-Statistic Reduction of the Information Bottleneck to a Low-Dimensional Problem
by: Armstrong, Joss
Published: (2026)

Bayesian Conservative Policy Optimization (BCPO): A Novel Uncertainty-Calibrated Offline Reinforcement Learning with Credible Lower Bounds
by: Chatterjee, Debashis
Published: (2026)

The Geometry of Thought: Disclosing the Transformer as a Tropical Polynomial Circuit
by: Alpay, Faruk, et al.
Published: (2026)

Explain First, Trust Later: LLM-Augmented Explanations for Graph-Based Crypto Anomaly Detection
by: Watson, Adriana, et al.
Published: (2025)

Caterpillar GNN: Replacing Message Passing with Efficient Aggregation
by: Černý, Marek
Published: (2025)

Bicriteria Submodular Maximization
by: Feldman, Moran, et al.
Published: (2025)

Targeted Fine-Tuning of DNN-Based Receivers via Influence Functions
by: Tuononen, Marko, et al.
Published: (2025)

On the Accuracy of Newton Step and Influence Function Data Attributions
by: Rubinstein, Ittai, et al.
Published: (2025)

Robustness Auditing for Linear Regression: To Singularity and Beyond
by: Rubinstein, Ittai, et al.
Published: (2024)

TOPSIS-like metaheuristic for LABS problem
by: Urbańczyk, Aleksandra, et al.
Published: (2025)

Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits
by: Murray, Michael, et al.
Published: (2025)

Enhancing Diversity in Multi-objective Feature Selection
by: Miyandoab, Sevil Zanjani, et al.
Published: (2024)

FBMS: An R Package for Flexible Bayesian Model Selection and Model Averaging
by: Frommlet, Florian, et al.
Published: (2025)

Revisiting Madigan and Mosurski: Collapsibility via Minimal Separators
by: Heng, Pei, et al.
Published: (2025)

Closed-Form Beta Distribution Estimation from Sparse Statistics with Random Forest Implicit Regularization
by: Landers, Jonathan R.
Published: (2025)

Model-based Bootstrap of Controlled Markov Chains
by: Su, Ziwei, et al.
Published: (2026)

Limitations of Scalarisation in MORL: A Comparative Study in Discrete Environments
by: Shah, Muhammad Sa'ood, et al.
Published: (2025)

Intelligence Inertia: Physical Isomorphism and Applications
by: Han, Jipeng
Published: (2026)

Deterministic Algorithm and Faster Algorithm for Submodular Maximization subject to a Matroid Constraint
by: Buchbinder, Niv, et al.
Published: (2024)

Bayesian Modeling of Collatz Stopping Times: A Probabilistic Machine Learning Perspective
by: Bonacorsi, Nicolò, et al.
Published: (2026)

Escaping Saddle Points via Curvature-Calibrated Perturbations: A Complete Analysis with Explicit Constants and Empirical Validation
by: Alpay, Faruk, et al.
Published: (2025)

Towards Verifiable AI with Lightweight Cryptographic Proofs of Inference
by: Anchuri, Pranay, et al.
Published: (2026)

Primal-Dual Sample Complexity Bounds for Constrained Markov Decision Processes with Multiple Constraints
by: Buckley, Max, et al.
Published: (2025)

When Are Two RLHF Objectives the Same?
by: Gaikwad, Madhava
Published: (2025)