Minimal Conditions for Beneficial Neighbourhood Search and Local Descent

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Wallace, Mark G.
Format:	Preprint
Published:	2024
Subjects:	Artificial Intelligence
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Local Entropy Search over Descent Sequences for Bayesian Optimization
by: Stenger, David, et al.
Published: (2025)

The Minimal Search Space for Conditional Causal Bandits
by: Simoes, Francisco N. F. Q., et al.
Published: (2025)

Beneficial Reasoning Behaviors in Agentic Search and Effective Post-training to Obtain Them
by: Jin, Jiahe, et al.
Published: (2025)

Causal Neighbourhood Learning for Invariant Graph Representations
by: Job, Simi, et al.
Published: (2026)

Efficient Search for Customized Activation Functions with Gradient Descent
by: Strack, Lukas, et al.
Published: (2024)

From Multi-Agent to Single-Agent: When Is Skill Distillation Beneficial?
by: Xu, Binyan, et al.
Published: (2026)

Neighbourhood Transformer: Switchable Attention for Monophily-Aware Graph Learning
by: Luo, Yi, et al.
Published: (2026)

Planning as Descent: Goal-Conditioned Latent Trajectory Synthesis in Learned Energy Landscapes
by: García, Carlos Vélez, et al.
Published: (2025)

LocalSearchBench: Benchmarking Agentic Search in Real-World Local Life Services
by: He, Hang, et al.
Published: (2025)

Provable Benefit of Sign Descent: A Minimal Model Under Heavy-Tailed Class Imbalance
by: Yadav, Robin, et al.
Published: (2025)

Locally-Minimal Probabilistic Explanations
by: Izza, Yacine, et al.
Published: (2023)

Minimizing Weighted Counterfactual Regret with Optimistic Online Mirror Descent
by: Xu, Hang, et al.
Published: (2024)

Backdoor4Good: Benchmarking Beneficial Uses of Backdoors in LLMs
by: Li, Yige, et al.
Published: (2026)

Thermodynamic Diffusion Inference with Minimal Digital Conditioning
by: De, Aditi
Published: (2026)

Iterated Local Search with Linkage Learning
by: Tinós, Renato, et al.
Published: (2024)

Local Search for Integer Quadratic Programming
by: He, Xiang, et al.
Published: (2024)

Easier to Mislead Than to Correct: Harmful and Beneficial Revision in LLM Conformity
by: Qu, Jiaming, et al.
Published: (2026)

On when is Reservoir Computing with Cellular Automata Beneficial?
by: Glover, Tom, et al.
Published: (2024)

Minimal, Local, Causal Explanations for Jailbreak Success in Large Language Models
by: Kumar, Shubham, et al.
Published: (2026)

When Errors Can Be Beneficial: A Categorization of Imperfect Rewards for Policy Gradient
by: Shang, Shuning, et al.
Published: (2026)

Exploration through Generation: Applying GFlowNets to Structured Search
by: Matovic, Mark Phillip
Published: (2025)

Athanor: Local Search over Abstract Constraint Specifications
by: Attieh, Saad, et al.
Published: (2024)

Developmental Support Approach to AI's Autonomous Growth: Toward the Realization of a Mutually Beneficial Stage Through Experiential Learning
by: Endo, Taichiro
Published: (2025)

Beyond Local Sharpness: Communication-Efficient Global Sharpness-aware Minimization for Federated Learning
by: Caldarola, Debora, et al.
Published: (2024)

Extracting Problem Structure with LLMs for Optimized SAT Local Search
by: Schidler, André, et al.
Published: (2025)

Broadband Ground Motion Synthesis by Diffusion Model with Minimal Condition
by: Jung, Jaeheun, et al.
Published: (2024)

TransAM: Transformer-Based Agent Modeling for Multi-Agent Systems via Local Trajectory Encoding
by: Wallace, Conor, et al.
Published: (2025)

Towards Undistillable Models by Minimizing Conditional Mutual Information
by: Ye, Linfeng, et al.
Published: (2025)

Minimal and Mechanistic Conditions for Behavioral Self-Awareness in LLMs
by: Bozoukov, Matthew, et al.
Published: (2025)

Enhancing Local Search for MaxSAT with Deep Differentiation Clause Weighting
by: Jiang, Menghua, et al.
Published: (2025)

AutoPBO: LLM-powered Optimization for Local Search PBO Solvers
by: Li, Jinyuan, et al.
Published: (2025)

Data-Efficient Contrastive Self-supervised Learning: Most Beneficial Examples for Supervised Learning Contribute the Least
by: Joshi, Siddharth, et al.
Published: (2023)

Completeness of Unbounded Best-First Minimax and Descent Minimax
by: Cohen-Solal, Quentin
Published: (2026)

Revisiting Cross-Attention Mechanisms: Leveraging Beneficial Noise for Domain-Adaptive Learning
by: Zang, Zelin, et al.
Published: (2026)

NERVE: Neighbourhood & Entropy-guided Random-walk for training free open-Vocabulary sEgmentation
by: Mahatha, Kunal, et al.
Published: (2025)

Policy Mirror Descent with Lookahead
by: Protopapas, Kimon, et al.
Published: (2024)

Gradient Descent Algorithm Survey
by: Fucheng, Deng, et al.
Published: (2025)

Dynamic Replanning for Improved Public Transport Routing
by: Abuaisha, Abdallah, et al.
Published: (2025)

DiffusionGS: Generative Search with Query Conditioned Diffusion in Kuaishou
by: Li, Qinyao, et al.
Published: (2025)

Trapezoidal Gradient Descent for Effective Reinforcement Learning in Spiking Networks
by: Pan, Yuhao, et al.
Published: (2024)