New online inverse optimization algorithm achieves O(d) regret, spotlights Cogentic agent framework
IgorCarron · x · 2026-09-17
- A new result in online inverse optimization introduces an efficient algorithm with O(d) regret and an elegant analysis.
- Igor Carron notes the work uses Cogentic, an agentic framework he hadn't seen before and finds worth exploring.
More from Research
- "WoWbench": the idea of testing AI general intelligence in a private WoW server — djcows · 2026-09-17
- Thinking With Looped Flows Hits 58.8% on ARC-AGI-1, Joining the Looped-Flow Reasoning Wave — alec_helbling · 2026-09-17
- Flow Reasoning Models Turn Flow Models Into Recurrent Reasoners, Hitting 99.5% on Sudoku-Extreme — alec_helbling · 2026-09-17
- FRM Matches EqR on Sudoku-Extreme With 44x Fewer FLOPs — alec_helbling · 2026-09-17
- Flow Reasoning Models: turning flow models into recurrent reasoners without BPTT — alec_helbling · 2026-09-17
- Gen-COMPAS: diffusion model proposes, physics decides for rare molecular transitions — bravo_abad · 2026-09-17