Imagen de Portada

Anytime Cooperative Implicit Hitting Set Solving

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Rollón, Emma, Larrosa, Javier, Petrova, Aleksandra
Formato:	Preprint
Publicado:	2025
Materias:	Artificial Intelligence
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Empirical Evaluation of the Implicit Hitting Set Approach for Weighted CSPs
por: Petrova, Aleksandra, et al.
Publicado: (2025)

Efficient and Reliable Hitting-Set Computations for the Implicit Hitting Set Approach
por: Ihalainen, Hannes, et al.
Publicado: (2025)

Anytime Single-Step MAPF Planning with Anytime PIBT
por: Gandotra, Nayesha, et al.
Publicado: (2025)

Anytime Safe PAC Efficient Reasoning
por: Yu, Chengyao, et al.
Publicado: (2026)

A-MHA*: Anytime Multi-Heuristic A*
por: Natarajan, Ramkumar, et al.
Publicado: (2025)

Towards Anytime-Valid Statistical Watermarking
por: Huang, Baihe, et al.
Publicado: (2026)

A Lightweight Traffic Map for Efficient Anytime LaCAM*
por: Shen, Bojie, et al.
Publicado: (2026)

Learning Set Functions with Implicit Differentiation
por: Özcan, Gözde, et al.
Publicado: (2024)

Online POMDP Planning with Anytime Deterministic Optimality Guarantees
por: Barenboim, Moran, et al.
Publicado: (2023)

Constant-time Motion Planning with Anytime Refinement for Manipulation
por: Mishani, Itamar, et al.
Publicado: (2023)

A Generic Complete Anytime Beam Search for Optimal Decision Tree
por: Kiossou, Harold Silvère, et al.
Publicado: (2025)

Anytime Multi-Agent Path Finding with an Adaptive Delay-Based Heuristic
por: Phan, Thomy, et al.
Publicado: (2024)

Anytime-Constrained Reinforcement Learning
por: McMahan, Jeremy, et al.
Publicado: (2023)

Pressure Reveals Character: Behavioural Alignment Evaluation at Depth
por: Petrova, Nora, et al.
Publicado: (2026)

An Optimistic Algorithm for online CMDPS with Anytime Adversarial Constraints
por: Zhu, Jiahui, et al.
Publicado: (2025)

Anytime Sequential Halving in Monte-Carlo Tree Search
por: Sagers, Dominic, et al.
Publicado: (2024)

Anytime Optimal Decision Tree Learning with Continuous Features
por: Kiossou, Harold, et al.
Publicado: (2026)

NeuroPAL: Punctuated Anytime Learning with Neuroevolution for Macromanagement in Starcraft: Brood War
por: O'Connor, Jim, et al.
Publicado: (2025)

Anytime Probabilistically Constrained Provably Convergent Online Belief Space Planning
por: Zhitnikov, Andrey, et al.
Publicado: (2024)

Provable Anytime Ensemble Sampling Algorithms in Nonlinear Contextual Bandits
por: Sun, Jiazheng, et al.
Publicado: (2025)

Anytime Training with Schedule-Free Spectral Optimization
por: Apte, Anuj, et al.
Publicado: (2026)

Anytime Incremental $ρ$POMDP Planning in Continuous Spaces
por: Benchetrit, Ron, et al.
Publicado: (2025)

Is PRM Necessary? Problem-Solving RL Implicitly Induces PRM Capability in LLMs
por: Feng, Zhangying, et al.
Publicado: (2025)

GHOST: Solving the Traveling Salesman Problem on Graphs of Convex Sets
por: Tang, Jingtao, et al.
Publicado: (2025)

Hitting "Probe"rty with Non-Linearity, and More
por: Pal, Avik, et al.
Publicado: (2024)

Better Understandings and Configurations in MaxSAT Local Search Solvers via Anytime Performance Analysis
por: Ye, Furong, et al.
Publicado: (2024)

The Missing Red Line: How Commercial Pressure Erodes AI Safety Boundaries
por: Petrova, Nora, et al.
Publicado: (2026)

Problem Solving Through Human-AI Preference-Based Cooperation
por: Dutta, Subhabrata, et al.
Publicado: (2024)

Conformal Selective Acting: Anytime-Valid Risk Control for RLVR-Trained LLMs
por: Khosravi, Hamed, et al.
Publicado: (2026)

Implicit Safe Set Algorithm for Provably Safe Reinforcement Learning
por: Zhao, Weiye, et al.
Publicado: (2024)

Optimizing Anytime Reasoning via Budget Relative Policy Optimization
por: Qi, Penghui, et al.
Publicado: (2025)

Anytime-Valid Answer Sufficiency Certificates for LLM Generation via Sequential Information Lift
por: Akter, Sanjeda, et al.
Publicado: (2025)

Solving Decision Theory Problems with Probabilistic Answer Set Programming
por: Azzolini, Damiano, et al.
Publicado: (2024)

Anytime Pretraining: Horizon-Free Learning-Rate Schedules with Weight Averaging
por: Meterez, Alexandru, et al.
Publicado: (2026)

Anytime-Constrained Equilibria in Polynomial Time
por: McMahan, Jeremy
Publicado: (2024)

CITE: Anytime-Valid Statistical Inference in LLM Self-Consistency
por: Ota, Hirofumi, et al.
Publicado: (2026)

Reliable Classification with Conformal Learning and Interval-Type 2 Fuzzy Sets
por: Fumanal-Idocin, Javier, et al.
Publicado: (2025)

Adaptive Anytime Multi-Agent Path Finding Using Bandit-Based Large Neighborhood Search
por: Phan, Thomy, et al.
Publicado: (2023)

Beyond Either-Or Reasoning: Transduction and Induction as Cooperative Problem-Solving Paradigms
por: Zenkner, Janis, et al.
Publicado: (2025)

From In Silico to In Vitro: Evaluating Molecule Generative Models for Hit Generation
por: Osman, Nagham, et al.
Publicado: (2025)