·
DataBubble
  • Home
  • Models
  • News
  • Compare
  • Boards
  • Pricing
  • About
  • Newsletter
  • Methodology
  • Contact
Latest
Life After Benchmark Saturation: A Case Study of CORE-Bench1h◆Clinical Harness for Governable Medical AI Skill Ecosystems1h◆OpenRCA 2.0: From Outcome Labels to Causal Process Supervision1h◆TOPS: First-Principles Visual Token Pruning via Constructing Token Optimal Preservation Sets for Efficient MLLM Inference1h◆Localizing RL-Induced Tool Use to a Single Crosscoder Feature1h◆GEOALIGN: Geometric Rollout Curation for Robust LLM Reinforcement Learning1h◆Beyond Global Divergences: A Local-Mass Perspective on Bayesian Inference1h◆Joint Reward Modeling: Internalizing Chain-of-Thought for Efficient Visual Reward Models1h◆Tuning Language Models by Mixture-of-Depths Ensemble1h◆Rotary Position Encodings for Graphs1h◆An LLM-Native Psychometric Instrument Does Not Predict LLM Behavior: Evidence Across 25 Models1h◆When Role-playing, Do Models Believe What They Say?1h◆Multilingual Reasoning Cascades Need More Context1h◆Federated Hash Projected Latent Factor Learning1h◆A probabilistic framework for online test-time adaptation1h◆Over-parameterization and Adversarial Robustness in Neural Networks: An Overview and Empirical Analysis1h◆No Free Lunch: Non-Asymptotic Analysis of Prediction-Powered Inference1h◆Knowledge-augmented Agentic AI for Mental Health Medication Information Seeking1h◆The Verification Horizon: No Silver Bullet for Coding Agent Rewards1h◆AlgoEvolve: LLM-driven Meta-evolution of Algorithmic Trading Programs1h◆Life After Benchmark Saturation: A Case Study of CORE-Bench1h◆Clinical Harness for Governable Medical AI Skill Ecosystems1h◆OpenRCA 2.0: From Outcome Labels to Causal Process Supervision1h◆TOPS: First-Principles Visual Token Pruning via Constructing Token Optimal Preservation Sets for Efficient MLLM Inference1h◆Localizing RL-Induced Tool Use to a Single Crosscoder Feature1h◆GEOALIGN: Geometric Rollout Curation for Robust LLM Reinforcement Learning1h◆Beyond Global Divergences: A Local-Mass Perspective on Bayesian Inference1h◆Joint Reward Modeling: Internalizing Chain-of-Thought for Efficient Visual Reward Models1h◆Tuning Language Models by Mixture-of-Depths Ensemble1h◆Rotary Position Encodings for Graphs1h◆An LLM-Native Psychometric Instrument Does Not Predict LLM Behavior: Evidence Across 25 Models1h◆When Role-playing, Do Models Believe What They Say?1h◆Multilingual Reasoning Cascades Need More Context1h◆Federated Hash Projected Latent Factor Learning1h◆A probabilistic framework for online test-time adaptation1h◆Over-parameterization and Adversarial Robustness in Neural Networks: An Overview and Empirical Analysis1h◆No Free Lunch: Non-Asymptotic Analysis of Prediction-Powered Inference1h◆Knowledge-augmented Agentic AI for Mental Health Medication Information Seeking1h◆The Verification Horizon: No Silver Bullet for Coding Agent Rewards1h◆AlgoEvolve: LLM-driven Meta-evolution of Algorithmic Trading Programs1h◆
News/AlgoEvolve: LLM-driven Meta-evolution of Algorithmic Trading Programs
arxiv
PublishedJune 26, 2026 at 4:00 AM
—neutral

AlgoEvolve: LLM-driven Meta-evolution of Algorithmic Trading Programs

Source
arxiv.orgfull article ↗
Read on arxiv→
Publisher summary· verbatim

arXiv:2606.26173v1 Announce Type: new Abstract: Recent work shows that Large Language Models (LLMs) can act as semantic mutation operators for the evolutionary discovery of programs and proofs. Most current applications focus on static coding benchmarks. We extend this paradigm to algorithmic tradin

Stay posted· Newsletter

A 5-min weekly brief — top movers, price watch, story of the week.

// no spam · unsubscribe one-click · free forever

Discussion
Source
↗
arxiv
Read original ↗All from arxiv →

No replies yet. Be first.

Source
↗
arxiv
Read original ↗All from arxiv →

Related coverage

More from ARXIV
arxivLife After Benchmark Saturation: A Case Study of CORE-Bench1harxivClinical Harness for Governable Medical AI Skill Ecosystems1harxivOpenRCA 2.0: From Outcome Labels to Causal Process Supervision1harxivTOPS: First-Principles Visual Token Pruning via Constructing Token Optimal Preservation Sets for Efficient MLLM Inference1h
The Bubble Brief
WEEKLY

Read AI insights every Tuesday — top movers, new releases, story of the week.

// no spam · unsubscribe one-click · free forever

Originally published on arxiv ↗
HomeModelsNews