Dewasurendra

LIVE PULSE

4.0 Anthropic CEO Amodei calls for slower AI development and shared safety rules — 11 src2.2 Agility Robotics unveils Digit 5 humanoid for warehouses and factories — 2 src2.0 Apple ships rebuilt Siri with Google Gemini, but not in the EU — 2 src1.8 Siri AI in macOS 27 Golden Gate: FAQ, Germany availability, privacy questions — 2 src1.4 Sam Altman says OpenAI will not go public in 2026, citing AI safety concerns — 5 src1.1 OpenAI contractors review real ChatGPT conversations to rate responses, report says — 2 src1.1 Anthropic data retention policy prompts firms to limit Claude use for sensitive work — 1 src1.1 Study examines issue bias in LLMs used as writing assistants before Swedish 2026 election — 1 src1.1 Study Audits Misalignment in Multi-Modal World Models — 1 src1.1 Retrieval-Grounded Reasoning Approach Proposed for Universal Multimodal Embeddings — 1 src4.0 Anthropic CEO Amodei calls for slower AI development and shared safety rules — 11 src2.2 Agility Robotics unveils Digit 5 humanoid for warehouses and factories — 2 src2.0 Apple ships rebuilt Siri with Google Gemini, but not in the EU — 2 src1.8 Siri AI in macOS 27 Golden Gate: FAQ, Germany availability, privacy questions — 2 src1.4 Sam Altman says OpenAI will not go public in 2026, citing AI safety concerns — 5 src1.1 OpenAI contractors review real ChatGPT conversations to rate responses, report says — 2 src1.1 Anthropic data retention policy prompts firms to limit Claude use for sensitive work — 1 src1.1 Study examines issue bias in LLMs used as writing assistants before Swedish 2026 election — 1 src1.1 Study Audits Misalignment in Multi-Modal World Models — 1 src1.1 Retrieval-Grounded Reasoning Approach Proposed for Universal Multimodal Embeddings — 1 src

person1 events

papersTODAY 04:00 UTC

Online Inverse Linear Optimization Algorithm Achieves O(d) Regret

A new arXiv paper presents a deterministic algorithm for online inverse linear optimization that attains O(d) regret, a bound that holds uniformly across the time horizon. Each round requires O(d^2) computation time. The result matches a recent bound by Dewasurendra and addresses an open question raised by Gollapudi and colleagues.

optimization/algorithms/online-learning/theory