·
DataBubble
  • Home
  • Models
  • News
  • Compare
  • Boards
  • Pricing
  • About
  • Newsletter
  • Methodology
  • Contact
Latest
DBMol: Design of High-Affinity, Target-Specific Small Molecules through Structure Prediction Models2h◆HPD-Parsing: Hierarchical Parallel Document Parsing2h◆A Geometry-Aware AI Emulator for the Coupled Whole Atmosphere from Earth Surface to the Ionosphere and Thermosphere2h◆Low-Rank Evolutionary Deep Neural Networks via Adaptive Tangent-Space Reduction2h◆Pain in 3D: Generating Controllable Synthetic Faces for Automated Pain Assessment2h◆DeepPAAC: A New Deep Galerkin Method for Principal-Agent Problems2h◆Tumor-anchored deep feature random forests for out-of-distribution detection in lung cancer segmentation2h◆HERAKLES: Hierarchical Skill Compilation for Open-ended LLM Agents2h◆RUBRIC: Realism--Utility Balanced Ranking for Imbalanced Classification2h◆JD-BP: A Joint-Decision Generative Framework for Auto-Bidding and Pricing2h◆Finding a stationary point of a stochastic convex problem2h◆Thermodynamics-Informed Input Reparameterization for Neural Prediction of Real-Fluid Thermodynamic Properties in Supercritical Combustion2h◆Training and Simulation of Quadrupedal Robot in Adaptive Stair Climbing and Descending for Indoor Firefighting: An End-to-End Reinforcement Learning Approach2h◆Give Them an Inch and They Will Take a Mile:Understanding and Measuring Caller Identity Confusion in MCP-Based AI Systems2h◆SWE-Milestone: Evaluating AI Agents on Continuous Software Evolution2h◆TransDex: Pre-training Visuo-Tactile Policy with Point Cloud Reconstruction for Dexterous Manipulation of Transparent Objects2h◆AnchorRefine: Synergy-Manipulation Based on Trajectory Anchor and Residual Refinement for Vision-Language-Action Models2h◆Agentic AI-assisted coding offers a unique opportunity to instill epistemic grounding during software development2h◆Large Language Models Explore by Latent Distilling2h◆Lifting Embodied World Models for Planning and Control2h◆DBMol: Design of High-Affinity, Target-Specific Small Molecules through Structure Prediction Models2h◆HPD-Parsing: Hierarchical Parallel Document Parsing2h◆A Geometry-Aware AI Emulator for the Coupled Whole Atmosphere from Earth Surface to the Ionosphere and Thermosphere2h◆Low-Rank Evolutionary Deep Neural Networks via Adaptive Tangent-Space Reduction2h◆Pain in 3D: Generating Controllable Synthetic Faces for Automated Pain Assessment2h◆DeepPAAC: A New Deep Galerkin Method for Principal-Agent Problems2h◆Tumor-anchored deep feature random forests for out-of-distribution detection in lung cancer segmentation2h◆HERAKLES: Hierarchical Skill Compilation for Open-ended LLM Agents2h◆RUBRIC: Realism--Utility Balanced Ranking for Imbalanced Classification2h◆JD-BP: A Joint-Decision Generative Framework for Auto-Bidding and Pricing2h◆Finding a stationary point of a stochastic convex problem2h◆Thermodynamics-Informed Input Reparameterization for Neural Prediction of Real-Fluid Thermodynamic Properties in Supercritical Combustion2h◆Training and Simulation of Quadrupedal Robot in Adaptive Stair Climbing and Descending for Indoor Firefighting: An End-to-End Reinforcement Learning Approach2h◆Give Them an Inch and They Will Take a Mile:Understanding and Measuring Caller Identity Confusion in MCP-Based AI Systems2h◆SWE-Milestone: Evaluating AI Agents on Continuous Software Evolution2h◆TransDex: Pre-training Visuo-Tactile Policy with Point Cloud Reconstruction for Dexterous Manipulation of Transparent Objects2h◆AnchorRefine: Synergy-Manipulation Based on Trajectory Anchor and Residual Refinement for Vision-Language-Action Models2h◆Agentic AI-assisted coding offers a unique opportunity to instill epistemic grounding during software development2h◆Large Language Models Explore by Latent Distilling2h◆Lifting Embodied World Models for Planning and Control2h◆
News/The Price of Hidden Curvature: An $\widetilde{\Omega} (d^{5/4} \sqrt{T})$ Lower Bound for Bandit Convex Optimization
arxiv
PublishedJuly 22, 2026 at 4:00 AM
—neutral

The Price of Hidden Curvature: An $\widetilde{\Omega} (d^{5/4} \sqrt{T})$ Lower Bound for Bandit Convex Optimization

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

arXiv:2607.18652v1 Announce Type: cross Abstract: We establish a $\widetilde\Omega(d^{5/4}\sqrt T)$ lower bound on the minimax expected regret of stochastic bandit convex optimization of $1$-Lipschitz functions on the Euclidean ball. This presents the first nontrivial regret lower bound that grows f

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
arxivDBMol: Design of High-Affinity, Target-Specific Small Molecules through Structure Prediction Models2harxivHPD-Parsing: Hierarchical Parallel Document Parsing2harxivA Geometry-Aware AI Emulator for the Coupled Whole Atmosphere from Earth Surface to the Ionosphere and Thermosphere2harxivLow-Rank Evolutionary Deep Neural Networks via Adaptive Tangent-Space Reduction2h
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