Saved in:
| Main Authors: | Rollón, Emma, Larrosa, Javier, Petrova, Aleksandra |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2501.07896 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Empirical Evaluation of the Implicit Hitting Set Approach for Weighted CSPs
by: Petrova, Aleksandra, et al.
Published: (2025)
by: Petrova, Aleksandra, et al.
Published: (2025)
Efficient and Reliable Hitting-Set Computations for the Implicit Hitting Set Approach
by: Ihalainen, Hannes, et al.
Published: (2025)
by: Ihalainen, Hannes, et al.
Published: (2025)
Anytime Single-Step MAPF Planning with Anytime PIBT
by: Gandotra, Nayesha, et al.
Published: (2025)
by: Gandotra, Nayesha, et al.
Published: (2025)
Anytime Safe PAC Efficient Reasoning
by: Yu, Chengyao, et al.
Published: (2026)
by: Yu, Chengyao, et al.
Published: (2026)
Towards Anytime-Valid Statistical Watermarking
by: Huang, Baihe, et al.
Published: (2026)
by: Huang, Baihe, et al.
Published: (2026)
A-MHA*: Anytime Multi-Heuristic A*
by: Natarajan, Ramkumar, et al.
Published: (2025)
by: Natarajan, Ramkumar, et al.
Published: (2025)
Anytime-Constrained Reinforcement Learning
by: McMahan, Jeremy, et al.
Published: (2023)
by: McMahan, Jeremy, et al.
Published: (2023)
Learning Set Functions with Implicit Differentiation
by: Özcan, Gözde, et al.
Published: (2024)
by: Özcan, Gözde, et al.
Published: (2024)
Online POMDP Planning with Anytime Deterministic Optimality Guarantees
by: Barenboim, Moran, et al.
Published: (2023)
by: Barenboim, Moran, et al.
Published: (2023)
Constant-time Motion Planning with Anytime Refinement for Manipulation
by: Mishani, Itamar, et al.
Published: (2023)
by: Mishani, Itamar, et al.
Published: (2023)
A Lightweight Traffic Map for Efficient Anytime LaCAM*
by: Shen, Bojie, et al.
Published: (2026)
by: Shen, Bojie, et al.
Published: (2026)
Pressure Reveals Character: Behavioural Alignment Evaluation at Depth
by: Petrova, Nora, et al.
Published: (2026)
by: Petrova, Nora, et al.
Published: (2026)
An Optimistic Algorithm for online CMDPS with Anytime Adversarial Constraints
by: Zhu, Jiahui, et al.
Published: (2025)
by: Zhu, Jiahui, et al.
Published: (2025)
Anytime Sequential Halving in Monte-Carlo Tree Search
by: Sagers, Dominic, et al.
Published: (2024)
by: Sagers, Dominic, et al.
Published: (2024)
Anytime Optimal Decision Tree Learning with Continuous Features
by: Kiossou, Harold, et al.
Published: (2026)
by: Kiossou, Harold, et al.
Published: (2026)
A Generic Complete Anytime Beam Search for Optimal Decision Tree
by: Kiossou, Harold Silvère, et al.
Published: (2025)
by: Kiossou, Harold Silvère, et al.
Published: (2025)
Anytime Multi-Agent Path Finding with an Adaptive Delay-Based Heuristic
by: Phan, Thomy, et al.
Published: (2024)
by: Phan, Thomy, et al.
Published: (2024)
Anytime Training with Schedule-Free Spectral Optimization
by: Apte, Anuj, et al.
Published: (2026)
by: Apte, Anuj, et al.
Published: (2026)
Anytime Incremental $ρ$POMDP Planning in Continuous Spaces
by: Benchetrit, Ron, et al.
Published: (2025)
by: Benchetrit, Ron, et al.
Published: (2025)
NeuroPAL: Punctuated Anytime Learning with Neuroevolution for Macromanagement in Starcraft: Brood War
by: O'Connor, Jim, et al.
Published: (2025)
by: O'Connor, Jim, et al.
Published: (2025)
Provable Anytime Ensemble Sampling Algorithms in Nonlinear Contextual Bandits
by: Sun, Jiazheng, et al.
Published: (2025)
by: Sun, Jiazheng, et al.
Published: (2025)
Anytime Probabilistically Constrained Provably Convergent Online Belief Space Planning
by: Zhitnikov, Andrey, et al.
Published: (2024)
by: Zhitnikov, Andrey, et al.
Published: (2024)
The Missing Red Line: How Commercial Pressure Erodes AI Safety Boundaries
by: Petrova, Nora, et al.
Published: (2026)
by: Petrova, Nora, et al.
Published: (2026)
Hitting "Probe"rty with Non-Linearity, and More
by: Pal, Avik, et al.
Published: (2024)
by: Pal, Avik, et al.
Published: (2024)
Is PRM Necessary? Problem-Solving RL Implicitly Induces PRM Capability in LLMs
by: Feng, Zhangying, et al.
Published: (2025)
by: Feng, Zhangying, et al.
Published: (2025)
GHOST: Solving the Traveling Salesman Problem on Graphs of Convex Sets
by: Tang, Jingtao, et al.
Published: (2025)
by: Tang, Jingtao, et al.
Published: (2025)
Problem Solving Through Human-AI Preference-Based Cooperation
by: Dutta, Subhabrata, et al.
Published: (2024)
by: Dutta, Subhabrata, et al.
Published: (2024)
Better Understandings and Configurations in MaxSAT Local Search Solvers via Anytime Performance Analysis
by: Ye, Furong, et al.
Published: (2024)
by: Ye, Furong, et al.
Published: (2024)
Optimizing Anytime Reasoning via Budget Relative Policy Optimization
by: Qi, Penghui, et al.
Published: (2025)
by: Qi, Penghui, et al.
Published: (2025)
SEA: State-Exchange Attention for High-Fidelity Physics Based Transformers
by: Esmati, Parsa, et al.
Published: (2024)
by: Esmati, Parsa, et al.
Published: (2024)
Anytime-Constrained Equilibria in Polynomial Time
by: McMahan, Jeremy
Published: (2024)
by: McMahan, Jeremy
Published: (2024)
Conformal Selective Acting: Anytime-Valid Risk Control for RLVR-Trained LLMs
by: Khosravi, Hamed, et al.
Published: (2026)
by: Khosravi, Hamed, et al.
Published: (2026)
Implicit Safe Set Algorithm for Provably Safe Reinforcement Learning
by: Zhao, Weiye, et al.
Published: (2024)
by: Zhao, Weiye, et al.
Published: (2024)
CITE: Anytime-Valid Statistical Inference in LLM Self-Consistency
by: Ota, Hirofumi, et al.
Published: (2026)
by: Ota, Hirofumi, et al.
Published: (2026)
Anytime-Valid Answer Sufficiency Certificates for LLM Generation via Sequential Information Lift
by: Akter, Sanjeda, et al.
Published: (2025)
by: Akter, Sanjeda, et al.
Published: (2025)
Anytime Pretraining: Horizon-Free Learning-Rate Schedules with Weight Averaging
by: Meterez, Alexandru, et al.
Published: (2026)
by: Meterez, Alexandru, et al.
Published: (2026)
Reliable Classification with Conformal Learning and Interval-Type 2 Fuzzy Sets
by: Fumanal-Idocin, Javier, et al.
Published: (2025)
by: Fumanal-Idocin, Javier, et al.
Published: (2025)
Solving Decision Theory Problems with Probabilistic Answer Set Programming
by: Azzolini, Damiano, et al.
Published: (2024)
by: Azzolini, Damiano, et al.
Published: (2024)
Beyond Either-Or Reasoning: Transduction and Induction as Cooperative Problem-Solving Paradigms
by: Zenkner, Janis, et al.
Published: (2025)
by: Zenkner, Janis, et al.
Published: (2025)
Scalable Anytime Algorithms for Learning Fragments of Linear Temporal Logic
by: Raha, Ritam, et al.
Published: (2021)
by: Raha, Ritam, et al.
Published: (2021)
Similar Items
-
Empirical Evaluation of the Implicit Hitting Set Approach for Weighted CSPs
by: Petrova, Aleksandra, et al.
Published: (2025) -
Efficient and Reliable Hitting-Set Computations for the Implicit Hitting Set Approach
by: Ihalainen, Hannes, et al.
Published: (2025) -
Anytime Single-Step MAPF Planning with Anytime PIBT
by: Gandotra, Nayesha, et al.
Published: (2025) -
Anytime Safe PAC Efficient Reasoning
by: Yu, Chengyao, et al.
Published: (2026) -
Towards Anytime-Valid Statistical Watermarking
by: Huang, Baihe, et al.
Published: (2026)