Read briefing · 2026-06-24

Briefing

62 items ·
Must read

Read these first.

1 items
ArXiv 2026-06-22 1 min read

The Energy Consumption of Transformer Fine-Tuning: A Roofline-Inspired Scaling Model

Why it matters

Introduces a roofline-inspired scaling law that accurately predicts Transformer (BERT) fine-tuning energy across heterogeneous multi-GPU configurations, validated via controlled architectural sweeps of BERT models.

Key details

  • Energy predictions use lightweight proxies for compute and memory traffic plus a speedup-based hardware-efficiency factor that captures effects of tensor parallelism and fully sharded data parallelism.
  • Paper by Mansour Zoubeirou a Mayaki, posted on arXiv 2026-06-22 as 2606.23546v1 (cs.LG, cs.AI, cs.AR, cs.CL, cs.DC).

Brief

Transformer fine-tuning energy modeling: the author proposes a roofline-inspired scaling model that maps measured energy to compute and memory-traffic proxies and a speedup-based hardware-efficiency term capturing tensor parallelism and fully sharded data parallelism. The law is validated on controlled BERT architectural sweeps across multiple GPUs and claims accurate predictions for heterogeneous training setups (arXiv 2606.23546v1).

Authors: Mansour Zoubeirou a Mayaki
Worth reading

Deeper context and second-pass items.

31 items
ArXiv 2026-06-22 1 min read

Self-Compacting Language Model Agents

Why it matters

SelfCompact pairs an inference-time compaction tool with a lightweight rubric that signals when to fire (e.g., sub-task resolved or trajectory converging) and when to suppress (e.g., mid-derivation or stuck), enabling adaptive compaction without fine-tuning or external supervision.

Key details

  • Across six benchmarks (competitive math and agentic search) and seven models, SelfCompact matches or exceeds fixed-interval summarization while reducing per-question token cost by 30–70%, yielding improvements up to 18.1 points on math and 5–9 points on agentic search.
  • The work exposes a meta-cognitive gap: unprompted models unevenly invoke compaction or fail to detect 'rotten' context, but a lightweight rubric closes this gap and elicits reliable compaction behavior without retraining.

Brief

SelfCompact is a runtime scaffold that lets language-model agents call a compaction tool under guidance from a simple rubric that specifies when to compact or suppress compaction. Evaluated on six benchmarks and seven models (ArXiv 2026-06-22), it matches or outperforms fixed-interval summarization while cutting per-question token costs 30–70% and improving accuracy up to 18.1 points on math.

Authors: Tianjian Li, Jingyu Zhang, William Jurayj...
ArXiv 2026-06-22 1 min read

Tapered Language Models

Why it matters

Bayat, Behrouz, and Courville (arXiv 2026-06-22) find that, under a fixed parameter budget, allocating more capacity to early layers and less to later layers reduces perplexity, whereas the reverse (heavier later layers) hurts performance.

Key details

  • They introduce Tapered Language Models (TLMs): tapering MLP width across depth with a smooth cosine schedule. Across three model scales and four architectures (Transformer, Gated Attention, Hope-attention, and Titans), tapering consistently improves perplexity and downstream benchmark performance at no extra parameter or compute cost.

Brief

Tapered Language Models (TLMs) argue that uniform per-layer parameter allocation is suboptimal: earlier layers benefit from more capacity while later layers can be slimmer. The authors run controlled experiments showing that tapering MLP width via a smooth cosine schedule (more width early, less later) improves perplexity and downstream benchmarks versus uniform-width baselines. Results hold across three model scales and four architectures; full paper available on arXiv (abstract provided).

Authors: Reza Bayat, Ali Behrouz, Aaron Courville
Twitter/X 2026-06-22 1 min read

Historic liquidity wave: SpaceX, OpenAI, and Anthropic are preparing to go public…

Why it matters

Historic liquidity wave: SpaceX, OpenAI, and Anthropic are preparing to go public and lockups are expiring; those three companies alone are projected to exceed the entire prior decade of venture exits combined (source: @theallinpod, published 2026-06-22).

Key details

  • Capital is likely to flow into AI's physical substrate—power, memory, copper, and specialized silicon—because Chamath framed AI as 'a power problem' and argued 'models commoditize, compute doesn't.'
  • Chamath listed six themes to watch: (1) the liquidity wave & the barbell, (2) AI is a power problem, (3) models commoditize while compute remains differentiated, (4) public vs. private trends are shifting, (5) can the US build a moat China can't cross?, and (6) human judgment as a scarce edge.

Brief

Chamath argues a historic liquidity wave is imminent as SpaceX, OpenAI and Anthropic prepare to go public and lockups expire, projected to exceed the prior decade of venture exits. He says capital will shift into AI’s physical substrate—power, memory, copper and specialized silicon—because models will commoditize while compute and human judgment remain scarce.

By @theallinpod
ArXiv 2026-06-22 1 min read

On the Limits of Prompt-Conditioned Language Models as General-Purpose Learners

Why it matters

Authors David Mguni, Julian Ma, and Jun Wang (arXiv 2026-06-22) prove a formal limit: an "expressivity floor" — when a task family's informational complexity exceeds the capacity of natural language as a channel, distinct tasks become indistinguishable to a prompt-conditioned Solver, creating an irreducible error even in the infinite-data regime (derived via PAC-Bayes bounds).

Key details

  • They also identify an "objective-misalignment floor": alignment or safety constraints can restrict admissible outputs so the User-ideal distribution lies outside the feasible set, producing unavoidable distortion that cannot be removed by more data or scaling.
  • Methodologically they model User–System interaction as a bilevel cheap-talk game and decompose task inference from execution; they conclude prompt-only interfaces are not universally sufficient and suggest multimodal inputs, external memory, or richer interfaces to increase task-relevant information and mitigate these limits.

Brief

The paper 'On the Limits of Prompt-Conditioned Language Models as General-Purpose Learners' models user–system interaction as a bilevel cheap-talk game and derives PAC-Bayes bounds to separate finite-sample estimation error from structural limits. It identifies an expressivity floor (language-channel capacity causes irreducible error even with infinite data) and an objective-misalignment floor (alignment constraints yield unavoidable distortion), and argues multimodal/external-memory interfaces can mitigate these limits.

Authors: David Mguni, Julian Ma, Jun Wang
ArXiv 2026-06-22 1 min read

Diffusion Models Adapt to Low-Dimensional Structure Under Flexible Coefficient Choices

Why it matters

Proves that for a broad class of update coefficients, O~(k/ε) iterations suffice to produce an ε-accurate sample in total variation (TV) distance, with the guarantee independent of the ambient dimension.

Key details

  • Establishes that adaptation to unknown k-dimensional structure is robust to coefficient choices (extending prior theory that required narrowly prescribed coefficients) and covers several commonly used diffusion samplers (Cai, Jiao, Li; 2026-06-22).

Brief

Diffusion models are analyzed for sensitivity of low-dimensional adaptation to update-coefficient choices: the authors prove that, for a broad family of coefficient schemes, only O~(k/ε) iterations are needed to obtain an ε-accurate sample in total variation, independently of ambient dimension. The result (Cai, Jiao, Li, 2026) broadens prior narrowly tuned convergence theory and explains empirical robustness; summary based on the abstract.

Authors: Changxiao Cai, Yuchen Jiao, Gen Li
ArXiv 2026-06-22 1 min read

Evaluation Awareness Is Not One Capability: Evidence from Open Language Models

Why it matters

Scope and detection: across eight experiments on 37 open-weight models spanning seven families, 24/37 models detect evaluation cues above chance; best model AUROC was 0.714 (human AUROC 0.819). Instruction tuning drove detectability more than model scale.

Key details

  • Behavioral impact: evaluation awareness shifts safety behavior — hypothetical framing reduced hard refusals by 5.8 percentage points; 21/140 HarmBench framing effects were significant, and compliance rose up to +30 percentage points in some framings.
  • Representations and independence: probes retained AUROC 0.98 under rewrites that pushed behavior below chance; multi-layer steering causally changed three downstream tasks while random controls did not. Only 1/15 axis correlations was significant (behavioral detection vs framing resistance ρ = -0.79, p < 0.001), motivating the authors' 'benchmark illusion' concept.

Brief

The paper studies evaluation awareness across 37 open-weight LMs (seven families) with eight experiments, showing models often detect test cues (24/37) and change safety behavior (hard refusals −5.8pp, compliance +30pp). Internal probes remain predictive (AUROC 0.98) and multi-layer steering is causal, but detectability, behavioral manifestation, and controllability vary independently—coined the 'benchmark illusion'.

Authors: Nilesh Nayan, Aishwarya Sampath Kumar, Rishiraj Girmal...
ArXiv 2026-06-22 1 min read

Open Problem: Is AdamW Effective Under Heavy-Tailed Noise?

Why it matters

The paper (Yu et al., arXiv 2026-06-22) poses the open problem whether AdamW converges under heavy-tailed stochastic gradient noise typical in LLM pretraining, noting existing theory mostly assumes finite-variance noise.

Key details

  • Authors prove a positive weighted-metric benchmark for AdamW and present a corridor lower-bound mechanism showing the optimizer's second-moment (denominator) memory can hide large gradients.
  • By contrast, recent work shows sign-based optimizers (Lion, Muon) attain sharp heavy-tailed rates and AdaGrad can converge under heavy tails; no prior rigorous heavy-tailed convergence result existed for AdamW.

Brief

The paper examines AdamW under heavy-tailed stochastic-gradient noise observed in LLM pretraining and asks whether its second-moment accumulator prevents convergence. Under this open problem (Yu et al., 2026-06-22), the authors provide a positive weighted-metric benchmark and a corridor-style lower bound that demonstrates how denominator memory can mask large gradients. (Abstract only; full text not assessed.)

Authors: Dingzhi Yu, Hongyi Tao, Yuanyu Wan...
ArXiv 2026-06-22 1 min read

Sublinearly Structured Deep Neural Networks Achieve Feature Learning Consistency for Compositional Functions

Why it matters

The paper proves feature-learning consistency for 'sublinearly structured' DNNs—architectures whose input/output dimensions and hidden-neuron counts grow sublinearly with sample size—when learning hierarchically compositional target functions; this consistency holds even in over-parameterized regimes where total parameters exceed the number of training samples.

Key details

  • Empirically, sublinearly structured DNNs match or surpass wide DNNs in prediction; a structural audit reports that common CNNs (AlexNet, VGGNet, ResNet, GoogLeNet) are sublinearly structured on standard image classification benchmarks. Authors: Sehwan Kim, Yan Sun, Faming Liang (arXiv:2606.23477v1, 2026-06-22).

Brief

Sublinearly structured DNNs—networks whose input/output dimensions and hidden-neuron counts grow sublinearly with training size—are shown (by Kim, Sun, Liang, arXiv:2606.23477v1) to achieve feature-learning consistency for hierarchically compositional target functions, even when total parameters exceed samples. The paper also proves universal approximation for such functions and reports empirical parity or gains versus wide networks; an audit finds AlexNet, VGGNet, ResNet, GoogLeNet fit this structure.

Authors: Sehwan Kim, Yan Sun, Faming Liang
Twitter/X 2026-06-23 1 min read

On 2026-06-23 Chamath warned a historic liquidity wave as SpaceX, OpenAI, and…

Why it matters

On 2026-06-23 Chamath warned a historic liquidity wave as SpaceX, OpenAI, and Anthropic prepare to go public and lockups expire; he projects those three companies alone will exceed the entire prior decade of venture exits combined.

Key details

  • Chamath says incoming capital will target the physical substrate of AI — specifically power, memory, copper, and specialized silicon — because "AI is a power problem" and compute scarcity will persist even as models commoditize.
  • He summarized six themes: (1) the liquidity wave & a "barbell" strategy, (2) AI as a power problem, (3) models will commoditize while compute won't, (4) shifting public vs. private market trends, (5) whether the US can build a China-resistant moat, and (6) human judgment as a scarce edge.

Brief

Chamath (All-In Podcast, 2026-06-23) argues a historic liquidity wave from imminent IPOs and lockup expirations at SpaceX, OpenAI, and Anthropic will redeploy capital into AI's physical substrate — power, memory, copper, and specialized silicon. He claims models will commoditize, compute/energy stay scarce, and outlines six themes including a barbell liquidity view, shifting public/private trends, a US–China moat question, and human judgment as a scarce edge.

By @chamath
ArXiv 2026-06-22 1 min read

SVD-Surgeon: Optimal Singular-Value Surgery for Large Language Model Compression

Why it matters

SVD-Surgeon adapts the Optimal Brain Surgeon (OBS) framework to the singular-value basis, treating each singular value as a parameter and deriving a closed-form, second-order update that compensates for singular values removed by truncation.

Key details

  • The method is training-free, operates directly on SVD factorizations (so it can be layered on top of existing SVD compressors such as SVD-LLM), and—per the authors—improves the perplexity–compression trade-off on the OPT family and LLaMA 2-7B without any retraining.
  • Paper by Mahmoud Safari and Frank Hutter, arXiv:2606.23568v1 (submitted 2026-06-22); 8 pages with 3 figures and 5 tables (PDF available).

Brief

SVD-Surgeon addresses LLM deployment costs by bringing OBS-style, second-order pruning to singular values: it treats singular values as parameters, computes a closed-form correction for retained values after truncation, and provides a saliency metric for pruning. The training-free method plugs into existing SVD compressors (tested with SVD-LLM) and reportedly improves the perplexity–compression trade-off on OPT models and LLaMA 2-7B without retraining.

Authors: Mahmoud Safari, Frank Hutter
ArXiv 2026-06-22 1 min read

Can LLMs Reliably Self-Report Adversarial Prefills, and How?

Why it matters

Across ten open-weight instruction-tuned LLMs (3B–70B) evaluated on four safety benchmarks, models failed to reliably recognize when outputs were elicited by adversarial prefill attacks, claiming intent on prefilled responses at an average rate of 27.3%.

Key details

  • Mechanisms: introspective signal largely stems from safety-/refusal-related reasoning; orthogonalizing weights against a refusal direction collapses the gap between claiming rates on prefilled vs. natural outputs to near zero (though that direction is not the sole mediator). Three LoRA finetuning methods (SFT, GRPO, DPO) tested on eight models (3B–27B) widened the intention-probe gap for every 8B–27B model, did not transfer to a tampering probe, and—counterintuitively—increased attack success under adversarial prefill on most models.

Brief

The paper evaluates whether LLMs can reliably self-report that a prior response was caused by an adversarial prefill. Using ten open-weight instruction-tuned models (3B–70B) and four safety benchmarks, authors find weak self-detection (27.3% average claiming rate). Orthogonalizing against a refusal direction removes the signal gap, but is not the only mediator. LoRA finetuning (SFT, GRPO, DPO) increased introspective gaps yet worsened attack success; framing probes (internal intent vs external tampering) yields different responses. Full text was not available in the source provided (abstract-only).

Authors: Quang Minh Nguyen, Uzair Ahmed, Taegyoon Kim
ArXiv 2026-06-22 1 min read

VeriEvol: Scaling Multimodal Mathematical Reasoning via Verifiable Evol-Instruct

Why it matters

VeriEvol introduces two decoupled components for scalable, verifiable visual-math data construction: a type-aware evolution module that rewrites low-difficulty image-question seeds into harder, image-grounded prompts, and HTV-Agent, a verifier that accepts answers only after multi-source counter-evidence fails to falsify them using offline hypothesis-test falsification.

Key details

  • On a five-benchmark visual-math suite, scaling evolved SFT training data from 10,000 to 250,000 samples increased mean accuracy from 35.42% to 54.73%.
  • Holding backbone, SFT initialization, and GRPO recipe fixed, VeriEvol yields a cumulative +3.88 accuracy gain over an un-evolved RL baseline: +1.82 from evolved prompts and +2.06 from the HTV-Agent verifier; authors release prompts, data, models, code, and full verifier traces.

Brief

VeriEvol tackles scalable, reliable visual mathematical reasoning by separating prompt difficulty (via type-aware evolution operators that generate harder, image-grounded prompts) from answer reliability (via HTV-Agent's multi-source hypothesis-test falsification). Applied on five visual-math benchmarks, evolved SFT data (10K→250K) raised mean accuracy from 35.42% to 54.73%, and VeriEvol added +3.88 over an un-evolved RL baseline. Artifacts and verifier traces are released for auditability.

Authors: Haoling Li, Kai Zheng, Jie Wu...
ArXiv 2026-06-22 1 min read

AIR: Adaptive Interleaved Reasoning with Code in MLLMs

Why it matters

AIR (Adaptive Interleaved Reasoning with Code) proposes a three-component RL-based solution: a two-stage cold-start data construction pipeline, data-filtering strategies for RL dataset curation, and an adaptive tool-invocation strategy using a group-constrained reward function for code-augmented interleaved reasoning in MLLMs.

Key details

  • After reinforcement-learning training, AIR improves average evaluation performance by 6.1 percentage points, raises accuracy on interleaved reasoning samples by 9.9 pp, and achieves a tool-use success rate exceeding 95%.
  • Paper by Cong Han, Xiaohan Lan, Haibo Qiu, and Yujie Zhong (arXiv 2026-06-22) targets numerical computation beyond prior vision-focused tool-use work (following the OpenAI o3 paradigm); data and code released at https://github.com/CongHan0808/AIR.git.

Brief

AIR (Adaptive Interleaved Reasoning with Code) equips MLLMs to interleave code execution and language reasoning for complex numerical tasks via extended reinforcement learning. The method combines a two-stage cold-start data pipeline, RL dataset filtering, and a group-constrained reward for adaptive tool invocation. Experiments report +6.1 pp average improvement, +9.9 pp on interleaved samples, and >95% tool-use success (Cong Han et al., 2026).

Authors: Cong Han, Xiaohan Lan, Haibo Qiu...
Twitter/X 2026-06-23 1 min read

Tencent open-sourced TencentDB Agent Memory (published 2026-06-23), a fully local…

Why it matters

Tencent open-sourced TencentDB Agent Memory (published 2026-06-23), a fully local long-term memory system for AI agents that claims a 61.38% reduction in token consumption and requires zero external API dependencies.

Key details

  • The system uses a 4-tier semantic pyramid (L0 raw logs, L1 atomic facts, L2 scene blocks, L3 distilled user persona) so agents read persona first and access raw logs only for verification.
  • Benchmarks on continuous long-horizon sessions (50 consecutive tasks each) report WideSearch task success rate up 51.52%, token usage down 61.38%, and PersonaMem accuracy rising from 48% to 76%; short-term logs are compressed into Mermaid symbol graphs navigated by node IDs.

Brief

TencentDB Agent Memory is an open-source, locally runnable long-term memory for agents that structures memory into four tiers (L0–L3), compresses heavy tool logs into Mermaid symbol graphs, and retrieves raw text only when needed. Published 2026-06-23, it reports a 61.38% token cut, +51.52% task success on WideSearch, and PersonaMem accuracy improving 48%→76% over 50-task continuous sessions.

By @hasantoxr
ArXiv 2026-06-22 1 min read

Randomized YaRN Improves Length Generalization for Long-Context Reasoning

Why it matters

Randomized YaRN combines YaRN-based positional extrapolation with randomized positional encodings (sampled from a larger position range) and a length curriculum to expose models to out-of-distribution positional representations during training on short contexts.

Key details

  • When trained on data with <8K context, Randomized YaRN consistently improves reasoning on BABILong and Multi‑Round Coreference Resolution (MRCR) at evaluation lengths from 16K to 128K, outperforming standard fine-tuning with the largest gains at far out-of-distribution lengths.

Brief

Randomized YaRN is a training method that improves large language models' length generalization by assigning YaRN positional encodings sampled from a larger position range and applying a length curriculum so short-context (<8K) inputs expose the model to OOD positional distributions. Evaluated on BABILong and MRCR, it yields consistent gains at 16K–128K context lengths and outperforms standard fine-tuning (results reported in the abstract).

Authors: Manas Mehta, Fangcong Yin, Greg Durrett
ArXiv 2026-06-22 1 min read

LIBERO-Safety: A Comprehensive Benchmark for Physical and Semantic Safety in Vision-Language-Action Models

Why it matters

LIBERO-Safety delivers a parametric safety benchmark plus a novel keypose-driven data-generation pipeline that procedurally creates stochastic, safety-critical scenarios and produced a large dataset of 19,664 strictly collision-free manipulation demonstrations with extensive domain randomization.

Key details

  • A cross-paradigm evaluation of eight VLA and two embodied foundation models revealed a generalization–safety tension: high-diversity training yields safer trajectories, but overall task success is bottlenecked by sub-optimal trajectory synthesis and semantic misalignment.
  • Paper accepted to ECCV 2026 (arXiv 2026-06-22); project page: https://libero-safety.github.io/

Brief

LIBERO-Safety introduces a parametric, procedurally generated benchmark and a keypose-driven pipeline to scale safety-critical robot manipulation data collection. The authors curate 19,664 strictly collision-free demonstrations with heavy domain randomization, then systematically evaluate eight vision-language-action and two embodied foundation models. Results show high-diversity training improves trajectory safety but task success is constrained by poor trajectory synthesis and semantic misalignment, framing future work on safe VLA models. (Accepted to ECCV 2026.)

Authors: Rongxu Cui, Zongzheng Zhang, Jingrui Pang...
ArXiv 2026-06-22 1 min read

MAS-PromptBench: When Does Prompt Optimization Improve Multi-Agent LLM Systems?

Why it matters

Juyang Bai and Laixi Shi (arXiv:2606.23664v1, published 2026-06-22) introduce MAS-PromptBench and systematically evaluate system-prompt optimization across multi-agent LLM setups varying task, workflow, communication protocol, and team size, showing prompt optimization can unlock significant system-level gains without model finetuning.

Key details

  • They benchmark two prompt optimizers that extend state-of-the-art single-agent methods and highlight a key MAS challenge: an exponentially growing prompt search space; project page and code are available (https://juyangbai.github.io/MAS-PromptBench/, https://github.com/juyangbai/MAS-PromptBench).

Brief

MAS-PromptBench investigates system-prompt optimization for multi-agent LLM systems by benchmarking two optimizers across diverse tasks, workflows, communication protocols, and team sizes. The authors report that prompt tuning can yield significant improvements at the system level without finetuning, but gains are sensitive to configuration and constrained by an exponentially growing prompt search space; code and a project page are provided.

Authors: Juyang Bai, Laixi Shi
ArXiv 2026-06-22 1 min read

Achieved over 96% validation accuracy and placed 7th overall in the NVIDIA…

Why it matters

Achieved over 96% validation accuracy and placed 7th overall in the NVIDIA Nemotron Model Reasoning Challenge (Bit Manipulation Puzzles); paper published on arXiv 2026-06-22 by Prateek Agnihotri et al.

Key details

  • Method abandons arithmetic logic in favor of string-similarity base selection (minimal bit-flips) to deduce truth tables, combined with backtracking DFS for collision detection/error recovery and a bit-tokenization + dynamic-masking SFT that forces single-bit tokens and oracle-style feedback.

Brief

An approach for solving Bit Manipulation Puzzles reframes logic-gate deduction as base selection using string-similarity (minimal bit flips) to extract primitive transformations and truth tables. The pipeline integrates backtracking DFS for robust error recovery and a bit-tokenized, dynamically masked SFT that trains models to hypothesize, self-evaluate, and backtrack. Evaluated on the challenge, it yielded >96% validation accuracy and 7th place.

Authors: Prateek Agnihotri, Sanchit Jain, Prabhat Agnihotri...
ArXiv 2026-06-22 1 min read

EnterpriseClawBench: Benchmarking Agents from Real Workplace Sessions

Why it matters

EnterpriseClawBench reproduces 852 tasks from real workplace agent sessions (paper posted 2026-06-22); each task is paired with recovered fixtures, rewritten prompts, role classes, skill subclasses, hard rules, and semantic rubrics. The raw enterprise data are not released; the authors publish a reusable construction and evaluation protocol and code at https://github.com/FrontisAI/EnterpriseClawBench.

Key details

  • Benchmark results show the best configuration reaches 0.663 (Codex combined with GPT-5.5). The authors highlight that enterprise-agent evaluation must report harness–model combinations, artifact delivery quality, visual quality, cost, runtime, and skill-transfer behavior rather than a single aggregated score.

Brief

EnterpriseClawBench is a benchmark built from proprietary, real-world workplace agent sessions that yields 852 reproducible tasks, each annotated with fixtures, rewritten prompts, role and skill taxonomies, hard rules, and semantic rubrics. Because the underlying enterprise content is private, the paper releases the construction/evaluation protocol and code; the best tested setup scores 0.663, underscoring the need for multi-dimensional evaluation metrics.

Authors: Jincheng Zhong, Weizhi Wang, Che Jiang...
Garry's List 2026-02-20 4 min read

Half the AI Agent Market Is One Category. The Rest Is Wide Open.

Why it matters

Software engineering accounts for roughly 49.7% of all AI agent tool calls (Anthropic METR data); the remaining activity is spread across ~16 verticals, none above 9%—healthcare 1.0%, legal 0.9%, education 1.8%.

Key details

  • Anthropic/METR capability assessments show Claude can solve tasks that would take a human nearly five hours, yet real-world 99.9th‑percentile session durations rose from under 25 minutes (Oct 2025) to over 45 minutes (Jan 2026), indicating a large deployment overhang.
  • Human–agent oversight metrics: 73% of tool calls include a human in the loop and only 0.8% of actions are irreversible; new users auto‑approve ~20% of Claude Code sessions (auto‑approve >40% by 750 sessions).
  • Behavioral shift with experience: novice users interrupt 5% of turns while veteran users interrupt 9%—users move from pre‑approval to active monitoring—supporting Levie/Garry Tan's playbook to build vertical agents with proprietary data, context engineering, and change management to capture market opportunity (the text argues for ~300 vertical AI unicorns).

Brief

Anthropic’s METR study finds software engineering dominates agentic AI—about 49.7% of tool calls—while other verticals (healthcare 1.0%, legal 0.9%, education 1.8%) remain effectively greenfield. Capability evaluations show Claude can complete tasks equivalent to nearly five human hours, yet real deployments have much shorter sessions: the 99.9th‑percentile turn duration increased from under 25 minutes in Oct 2025 to over 45 minutes by Jan 2026 (typical 99.9th‑percentile ~42 minutes), revealing a large deployment/trust gap. Safety and workflow telemetry show 73% of tool calls include humans and only 0.8% of actions are irreversible; new users auto‑approve ~20% of Claude Code sessions (rising above 40% after ~750 sessions), and experienced users interrupt more (9% vs 5%), indicating a shift to active monitoring. The article argues this gap plus domain complexity creates opportunities for vertical AI startups that embed proprietary data, deep context engineering, and change‑management to capture sizable, defensible markets.

By Garry Tan
ArXiv 2026-06-22 1 min read

Keep The Essentials: Efficient Reference Conditioned Generation via Token Dropping

Why it matters

Parihar et al. (published 2026-06-22) propose Sparse Context: a method that constructs sparse reference representations by retaining a reduced subset of reference tokens and fine-tuning diffusion models with random token dropping to make them robust and decoupled from any specific token selection rule.

Key details

  • Using task-aware token selection at inference, Sparse Context achieves up to 4× inference speedup for multi-reference generation and 2× for single-reference generation while preserving visual quality on spatially-aligned editing and subject-driven generation (per the paper's abstract).

Brief

Reference-conditioned diffusion models face high runtime cost as reference count grows. Parihar et al. introduce Sparse Context, which trains models with randomized reference-token dropping and at inference selects task-prioritized tokens, keeping only the most informative regions. The approach yields up to 4× speedups for multi-reference and 2× for single-reference generation without degrading visual quality.

Authors: Rishubh Parihar, Ayush Raina, R. Venkatesh Babu...
ArXiv 2026-06-22 1 min read

AI Exposure Scores: what they measure, what they miss, and what comes next

Why it matters

Lund et al. (2026) critique the widely used 2023 exposure scores from Eloundou et al. (the 'GPTs are GPTs' scores), noting these scores define exposure as the share of occupational tasks an LLM can assist with but suffer from temporal, geographic, and ontological limitations that distort policy analyses.

Key details

  • The paper surveys five research responses—dynamic/benchmark-based measures, ensemble methods, task-framework extensions, worker-centered metrics, and adoption/usage data—and highlights a coordination gap: policymakers must widen evidence, engage workers as epistemic partners, and shift from prediction to preparedness, while researchers should build data infrastructure, use participatory methods, and write with policymakers in mind.

Brief

AI exposure scores are evaluated by Lund, Euyang, Munyikwa, and Fadaee (2026), who show that static 2023 exposure metrics (Eloundou et al.) measure the fraction of occupational tasks LLMs can assist with but fail across time, place, and task ontologies. They catalogue five methodological improvements and argue the larger problem is weak researcher–policymaker coordination; better measurement helps but cannot substitute for participatory, policy-focused collaboration.

Authors: Campbell Lund, Thomas Euyang, Zanele Munyikwa...
ArXiv 2026-06-22 1 min read

GeoFidelity-Bench: Evaluating Segment-Level Geographic Fidelity in Text-to-Image Street-View Generation

Why it matters

GeoFidelity-Bench comprises 7,117 curated Mapillary images covering 109 named OpenStreetMap road segments in 25 cities across six continents; each generated panel is ranked against nearest-segment, other segments in the same city, and segments from other cities to test local discrimination.

Key details

  • Appending street and neighborhood names to city-only prompts increases top-1 retrieval accuracy by 5.5 percentage points (95% CI: 3.4–7.7) over city-only prompts, but the similarity margin between the target and the nearest same-city segment remains near zero; appending raw GPS coordinates as ordinary text shows no statistically clear benefit, and using incorrect local names captures only part of the gain.
  • Six open-weight text-to-image generators were evaluated; held-out real-image queries successfully recover segment identity (so the references contain usable segment-level signal), and results indicate a persistent gap between generating city-/neighborhood-plausible street views and faithfully reproducing a specific road segment.

Brief

GeoFidelity-Bench introduces a 7,117-image benchmark across 109 OSM road segments in 25 cities to measure segment-conditioned geographic fidelity of text-to-image street-view generation. Evaluating six open-weight generators with city-only, street+neighborhood, and GPS-augmented prompts, authors find a 5.5 pp top-1 accuracy boost from local names (95% CI 3.4–7.7) yet near-zero segment discrimination margin and no clear benefit from GPS text, revealing a gap between local plausibility and true segment-level fidelity.

Authors: Kaizhen Tan, Hanzhe Hong, Siru Tao
ArXiv 2026-06-22 1 min read

dVLA-RL: Reinforcement Learning over Denoising Trajectories for Discrete Diffusion Vision-Language-Action Models

Why it matters

dVLA-RL reforms discrete diffusion Vision-Language-Action (dVLA) training by optimizing the joint probability of the sampled denoising path (product of step-wise transitions), modeling denoising as an MDP to avoid the intractable marginal final-action probability and support variable denoising steps.

Key details

  • The method adds a unified step-scheduling scheme for multi-task learning (tailoring denoising steps to task complexity) and yields strong empirical gains: 99.7% success on LIBERO and a 30.6% improvement over the supervised fine-tuning (SFT) baseline on RoboTwin 2.0, while remaining competitive with World-Action Model baselines.

Brief

dVLA-RL (Wu et al., 2026) tackles intractable marginal-action probabilities in discrete diffusion VLA models by shifting the objective to the joint probability of denoising trajectories, treating the denoising chain as an MDP and optimizing step-wise transitions. Combined with a task-adaptive denoising-step scheduler, it reports 99.7% on LIBERO and +30.6% vs SFT on RoboTwin 2.0. Full text was not provided, summary based on the abstract.

Authors: Yuhao Wu, Yitian Liu, Weijie Shen...
ArXiv 2026-06-22 1 min read

RECALL: Recovery Experience Collection for Active Lifelong Learning in Vision-Language-Action Models

Why it matters

Active, uncertainty-guided recovery demonstration collection improves fine-tuning efficiency for Vision-Language-Action (VLA) models compared with passive imitation learning (Karli & Fitzgerald; arXiv 2026-06-22).

Key details

  • Fine-tuning only on actively-collected recovery data induces catastrophic forgetting; the authors evaluate replay-based data mixing and elastic weight consolidation (EWC) and report tradeoffs between plasticity to new recovery data and retention of prior behaviors in autoregressive VLAs.

Brief

Vision-Language-Action (VLA) models face inefficiencies when fine-tuned via passive imitation learning. Karli and Fitzgerald propose an active, uncertainty-guided continual learning pipeline that collects targeted recovery demonstrations: this improves adaptation efficiency but, when used alone, causes catastrophic forgetting. The paper empirically evaluates replay-based data mixing and elastic weight consolidation, revealing tradeoffs between plasticity and retention for autoregressive VLA policies. Full text not available; summary based on the abstract.

Authors: Ulas Berk Karli, Tesca Fitzgerald
ArXiv 2026-06-22 1 min read

LangMAP: A Language-Adaptive Approach to Tokenization

Why it matters

LangMAP (Language-adaptive MAP Tokenization) extends the UnigramLM algorithm to produce language-specific tokenizations from a single shared vocabulary, allowing adaptation of a pretrained model's tokenizer without changing its vocabulary; it requires language labels during training but performs language-specific tokenization at inference without input-language metadata.

Key details

  • Empirical evaluation used 14 open-source tokenizers across 9 natural languages and 9 programming languages: LangMAP improved morphological boundary alignment for natural languages and—for all 9 coding languages tested—improved alignment with AST leaf boundaries.
  • In fine-tuning experiments LangMAP improved target-language grammatical acceptability measured by MultiBLiMP on the languages tested, but yielded less consistent gains on knowledge-related tasks such as Global-PIQA and Belebele.

Brief

LangMAP adapts UnigramLM to the multilingual setting to produce language-specific tokenizations from a single shared vocabulary, addressing the cost of training new models or changing vocabularies. Evaluated on 14 tokenizers (9 natural, 9 programming languages), it improves morphological and AST-leaf alignment; fine-tuning gains are strong for grammatical acceptability (MultiBLiMP) but mixed on knowledge tasks. (Abstract only; full text not provided.)

Authors: Clara Meister, Suchir Salhan, Andrzej Szablewski...
ArXiv 2026-06-22 1 min read

LaST-HD: Learning Latent Physical Reasoning from Scalable Human Data for Robot Manipulation

Why it matters

LaST-HD (Jiaming Liu et al., arXiv:2606.23685v1, published 2026-06-22) aligns human-hand and robot demonstrations in a shared latent forward-dynamics space by training an auxiliary action-conditioned world model on unpaired human and robot trajectories, extending a reasoning-before-acting VLA rather than directly retargeting kinematics.

Key details

  • Out-of-Lab (OOL) Glove is a low-cost motion-capture glove developed for LaST-HD that provides precise hand keypoints; the collected human-hand data act as universal action supervision across both simple grippers and dexterous robot hands.
  • A progressive mixed-to-human training recipe (mixed human-robot co-training plus human-hand online correction) improves generalization to novel objects, scenes, and positions, and achieves over 90% accuracy using only 20 minutes of OOL Glove data.

Brief

LaST-HD presents a human-to-robot action learning paradigm that aligns human-hand and robot demonstrations in a shared latent forward-dynamics space via an auxiliary action-conditioned world model trained on unpaired trajectories. Combined with a low-cost OOL Glove and a mixed-to-human training procedure, it boosts generalization and reaches over 90% accuracy after 20 minutes of glove data. Only the abstract was available.

Authors: Jiaming Liu, Yinxi Wang, Chenyang Gu...
ArXiv 2026-06-22 1 min read

Learning to See While Learning to Act: Diffusion Models for Active Perception in Robot Imitation

Why it matters

See2Act couples action denoising with viewpoint refinement: the policy is trained using camera poses anchored to keyframe actions from offline demonstrations so it jointly learns where to look and how to act.

Key details

  • Empirical gains: the method recovers informative viewpoints under severe occlusions (Ravens) and improves RLBench task performance by up to 34% over prior methods.
  • Sim-to-real: after collecting 50 demonstrations in a digital twin and training with depth observations, the policy achieves zero-shot sim-to-real transfer on pick-and-place tasks.

Brief

See2Act addresses manipulation under partial observability by conditioning action prediction on actively inferred viewpoints: it couples action denoising with viewpoint refinement and trains policies using camera poses anchored to keyframe actions from offline demos. Results (abstract) show robust viewpoint recovery under severe occlusion, up to 34% improvement on RLBench, and zero-shot sim-to-real pick-and-place transfer after 50 simulated demonstrations using depth inputs. Summary based on the paper abstract.

Authors: Kuancheng Wang, Vaibhav Saxena, Shuo Cheng...
ArXiv 2026-06-22 1 min read

Action-BED: Task-Driven Bayesian Experimental Design with Singly Intractable Objectives

Why it matters

Action-BED (ACTION-BED) reformulates Bayesian experimental design (BED) around an expected future loss (EFL) and algebraically converts EFL objectives from doubly intractable to singly intractable, enabling joint optimisation of the design policy and a downstream action policy with stochastic gradients.

Key details

  • The method requires only the ability to sample from the joint model over parameters and data and to evaluate the downstream loss — it avoids any explicit posterior or marginal likelihood estimation and supports easy customization to task-specific losses.
  • Preprint by Tom Rossa, Angus Phillips, and Tom Rainforth on arXiv (stat.ML, cs.LG), posted 2026-06-22 (arXiv:2606.23662v1; PDF available).

Brief

Action-BED reformulates Bayesian experimental design using an expected future loss (EFL) on downstream actions and algebraically rearranges EFLs into singly intractable objectives that can be jointly optimised over design and action policies with stochastic gradients. By only requiring joint-model sampling and loss evaluation, it removes explicit posterior/marginal-likelihood estimation and enables task-driven design. Summary based on the abstract.

Authors: Tom Rossa, Angus Phillips, Tom Rainforth
Twitter/X 2026-06-23 1 min read

On 2026-06-23, Andrej Karpathy called Claude's interaction model the "third major…

Why it matters

On 2026-06-23, Andrej Karpathy called Claude's interaction model the "third major redesign" of LLM UI/UX: first a website, then a desktop app, now a self-contained, persistent, asynchronous entity that integrates org-wide tools and context and can be addressed like a human team member.

Key details

  • Karpathy said making this work requires substantial engineering 'across tools, integrations, compute environments, memory, security' so Claude can seamlessly join teams and help with 'a very large variety of workloads.'
  • Anthropic announced Claude Tag for Slack: Claude can join as a team member with access to selected channels and tools, and users can tag Claude to delegate tasks.

Brief

Andrej Karpathy (2026-06-23) argues Claude exemplifies a new LLM UI/UX paradigm: a persistent, asynchronous team member that integrates org-wide tools and context. He warns this requires heavy engineering (tools, integrations, compute environments, memory, security) to 'just work.' Anthropic's Claude Tag for Slack demonstrates the idea by letting Claude join channels and accept delegated tasks.

By @karpathy
ArXiv 2026-06-22 1 min read

Variance or Standard Deviation? Shell Geometry and Global-Scale Priors in High-Dimensional Shrinkage

Why it matters

Gao & You (published on arXiv 2026-06-22) prove that priors flat on standard deviation (SD-flat) vs priors flat on variance allocate markedly different mass near the zero-scale boundary, producing distinct high-dimensional shrinkage risk behaviors.

Key details

  • Under a radial-power benchmark the SD-flat benchmark attains a one-unit asymptotic risk advantage near the origin, then 'crosses over' in a critical regime and is second-order equivalent to the variance-flat benchmark for strong signals.
  • Proper single global-scale hyperpriors and bounded coordinate-multiplier mixtures inherit these asymptotic limits via the near-zero exponent of their SD-scale density; for heavier-tailed or sparse priors the same exponent classifies the global-scale component while local-scale tails, model-size, or allocation priors can further affect risk.

Brief

High-dimensional Gaussian-shrinkage with a common global scale is analyzed by Wayne Yuan Gao and Zhiheng You (arXiv 2026-06-22). They show that whether a default prior is flat on variance or on standard deviation changes mass near zero and drives first-order differences in shrinkage risk: SD-flat yields a one-unit asymptotic advantage near the origin, crosses in a critical regime, and matches variance-flat for strong signals. Analysis in the abstract only; full text not included here.

Authors: Wayne Yuan Gao, Zhiheng You
Quick skim

Fast scan items.

30 items
Twitter/X 2026-06-23 4 min read

ClickUp launched Brain² (announced June 23, 2026) that runs GPT, Claude, and…

Why it matters

ClickUp launched Brain² (announced June 23, 2026) that runs GPT, Claude, and Gemini on a company's actual workspace data under one subscription; tagging @brain in any task causes it to act without an explicit prompt.

Key details

  • ClickUp reports quantitative outcomes: '3x faster', '58 days saved per employee per year', and claims Brain² won nearly 100% of blind pairwise comparisons in a three-week randomized study versus ChatGPT, Gemini, and Claude.
  • Brain²'s architecture centers on compressed context: an LLM pipeline processes every event (ClickUp cites ~100,000 daily activity items) through cheaper LLMs to summarize, organize, trigger and roll up into self-organizing memory and self-improving orchestration—prioritizing context orchestration over token‑maxxing or a 'better' model.
  • Operationally ClickUp describes a ~5:1 agent-to-human ratio (5,000 agents for 1,000 people), with most agents running as background triggers/loops; Brain² dynamically rewrites system prompts from real-time context and intent, remembers interactions company-wide, and can host any frontier model inside its harness.

Brief

ClickUp's Brain² is presented as a workspace-native AI layer that runs GPT, Claude and Gemini directly on company data and acts when you tag @brain in tasks. The product claims substantial productivity gains—3× speed, 58 days saved per employee per year—and a nearly 100% preference rate in a three-week blind study versus ChatGPT, Gemini and Claude. Technically, Brain² uses an LLM pipeline that summarizes ~100,000 daily events into compressed context, plus self-organizing memory and self‑improving orchestration; the company argues this context-first design, not a superior base model or token-maximization, drives the results. ClickUp reports scaling to a 5:1 agent-to-human ratio (5,000 agents for 1,000 people) with many agents running autonomously as triggers/loops, dynamic system-prompt rewriting by intent, and company-wide memory that compounds with use—allowing any internal team member to invoke work via simple commands like “@brain slides.”

By @hasantoxr
Twitter/X 2026-06-19 1 min read

Cloudflare announced Temporary Accounts for Workers on 2026-06-19 to let…

Why it matters

Cloudflare announced Temporary Accounts for Workers on 2026-06-19 to let automated agents obtain short-lived accounts for deployments.

Key details

  • Any AI agent can deploy a real app by running the CLI command "wrangler deploy --temporary" without human signup, OAuth, API tokens, or dashboard interaction.
  • Sid (@chatsidhartha) posted the announcement linking to the Cloudflare blog post titled "Temporary Cloudflare Accounts for AI agents."

Brief

Sid (@chatsidhartha) highlights Cloudflare's Temporary Accounts feature (announced 2026-06-19), which lets AI agents deploy real apps to Cloudflare Workers via the CLI command "wrangler deploy --temporary" without requiring a human to sign up, complete OAuth, create API tokens, or use the dashboard.

By @burcs
Twitter/X 2026-04-02 1 min read

Agentic AI is already in production in enterprises as of Apr 2, 2026, per…

Why it matters

Agentic AI is already in production in enterprises as of Apr 2, 2026, per @1aifanatic on the Ready Set Do Podcast with Naman; he contrasts RPA as 'train on tracks' with agentic AI as a 'car with GPS'.

Key details

  • Open-source agent stacks (LangGraph, CrewAI, Google ADK) are presented as competitors to enterprise platforms like UiPath Maestro, and a $0 local agent stack is practical using Ollama + Qwen 3.5.
  • Security risk: agents can misuse owners' payment methods (e.g., charging credit cards without permission); author is a 3x UiPath MVP who moved from .NET spreadsheet automation to agentic automation after UiPath Academy and a hackathon win (episode link piped.video, published 2026-04-02).

Brief

1aifanatic frames enterprise AI in 2026 as transitionary — agentic systems are already in production and outpacing traditional RPA. He contrasts open-source stacks (LangGraph, CrewAI, Google ADK) with enterprise tools (UiPath Maestro), outlines a $0 local agent stack (Ollama + Qwen 3.5), and flags security risks like unauthorized credit-card use; he shared this on the Ready Set Do Podcast (Apr 2, 2026).

By @1aifanatic
ArXiv 2026-06-22 1 min read

Solve for the Hyperparameter, Skip the Search: Kolmogorov-Optimal Scaling Laws for Spline Regression

Why it matters

Derives a closed-form minimizer for spline regression resolution by balancing squared bias (given by the Kolmogorov n-width, a known power of resolution G) and variance (via leave-one-out/PRESS); basis dimension is an explicit polynomial in G and the result yields a Kolmogorov-optimal scaling law where optimal resolution and error are power functions of effective density (sample size per active component).

Key details

  • Introduces KORE (Kolmogorov-optimal Order-aware Resolution Estimation): fit two pilot resolutions, solve a leverage-calibrated 2×2 system for bias/noise scales, evaluate the closed-form plug-in resolution and a small leave-one-out certificate (about a dozen fits). Empirically matches exhaustive 3-fold CV and classical criteria while fitting ≈8× fewer models (additive and sparse pairwise targets up to 80 dims); ranks first in accuracy-per-compute across 36 real tabular datasets versus 20 other methods.

Brief

Spline-regression hyperparameter tuning can be solved rather than searched: using classical approximation theory (Kolmogorov n-width), an explicit polynomial basis dimension in resolution G, and the PRESS leave-one-out identity, the authors derive a closed-form optimal resolution and a scaling law in interaction order. Their algorithm KORE estimates bias/noise from two pilot fits and computes the plug-in resolution with ~a dozen fits, matching exhaustive 3-fold CV and standard criteria while reducing compute (~8× fewer fits) and ranking best on 36 tabular datasets.

Authors: Yong Yi Bay, Kathleen A. Yearick
ArXiv 2026-06-22 1 min read

AutoDex: An Automated Real-World System for Dexterous Grasping Data Collection

Why it matters

AutoDex automates the full closed-loop real-world dexterous-grasp data collection pipeline using dense 20-camera perception, collision-monitored robot execution, lift-and-hold success labeling, and active object resets to expose additional stable poses.

Key details

  • The authors collected 3,593 grasp trials across Allegro and Inspire hands on 100 diverse objects, with synchronized multi-view observations and robot-state logs; code and data will be publicly released.
  • For a matched 500-trajectory collection AutoDex required 10.3 h versus 49.4 h for teleoperation (4.8× throughput); grasps retrieved from the AutoDex-validated database succeeded 76% versus 34% for simulation-only validation.

Brief

AutoDex is an automated real-world data-collection system for dexterous grasping that generates candidate grasps, localizes heavily occluded objects with a 20-camera rig, executes collision-monitored motions, labels lift-and-hold outcomes, and actively resets objects. Using this loop the authors gathered 3,593 trials on 100 objects (Allegro and Inspire hands), achieving a 4.8× speedup over teleoperation and much higher real-world success (76% vs 34%). Summary based on the paper abstract; full text was not available here.

Authors: Mingi Choi, Gunhee Kim, Jisoo Kim...
Twitter/X 2026-06-19 1 min read

Chamath (post published 2026-06-19) argues many seemingly “simple” features are…

Why it matters

Chamath (post published 2026-06-19) argues many seemingly “simple” features are actually complex because of cascades of dependencies, and that for complex enterprise systems this applies to most features.

Key details

  • 8090’s Software Factory (8090.ai) is presented as the solution: it helps write requirements, expand and frame dependencies, and execute with a global view; their agent converted the vague prompt "Let users reset their password from the login screen" into five structured requirements, including account-enumeration, rate-limiting, and token-expiry rules (see bit.ly/4vjp9bg).
  • Chamath emphasizes the product's visual system, saying he is “completely in love” with it (heart-eyes emoji), positioning visual tooling as a key differentiator.

Brief

Chamath (published 2026-06-19) warns that many apparently simple features hide cascades of dependencies that make them complex, especially in enterprise systems. He promotes 8090’s Software Factory (8090.ai) as an AI-native platform that writes and expands requirements and executes with global context; an agent demo turned a vague password-reset prompt into five concrete requirements (account-enumeration, rate-limit, token-expiry, etc.), and Chamath singles out the platform’s visual system as a standout feature.

By @chamath
ArXiv 2026-06-22 1 min read

PHAST-Net: Attention-Guided, Physics-Informed Network for Unified Estimation of Ideal Time-Frequency Representations

Why it matters

PHAST-Net (Cozens & Godsill; arXiv 2026-06-22) learns an application-general mapping from a constellation of Continuous Log-frequency Adaptive Wavelet Transforms (CLAWT) to high-resolution, cross-term-suppressed Ideal Time-Frequency Representations (ITFRs) including Spectrograms, Tempograms, and Metrograms.

Key details

  • Training includes a physics-informed auxiliary reprojection loss that reconstructs the observed CLAWT constellation from the predicted ITFR and the corresponding Cohen's-class kernels, enforcing transform consistency, energy conservation, and more stable optimization; attention layers further improve cross-term suppression.
  • Two extensions are introduced: Harmonic PHAST-Net for fundamental-only (harmonic) ITFRs and Spline-PHAST-Net which parameterizes detected time–frequency ridges as continuous spline trajectories for arbitrary-grid re-rendering and reconstruction; the model was trained on an effectively unbounded procedurally generated dataset and 'demonstrates improved accuracy over established approaches' (no numeric metrics in abstract).

Brief

PHAST-Net presents an attention-guided, physics-informed network that maps a selected constellation of Continuous Log-frequency Adaptive Wavelet Transforms (CLAWT) to unified Ideal Time-Frequency Representations (ITFRs). It uses Cohen's-class kernel analysis to choose CLAWTs, a reprojection loss to enforce transform consistency and energy conservation, and attention for cross-term suppression. Variants include Harmonic PHAST-Net and Spline-PHAST-Net; the abstract reports improved accuracy versus prior methods. Summary based on the paper abstract; full text was not reviewed.

Authors: James M. Cozens, Simon J. Godsill
Twitter/X 2026-06-17 1 min read

@code_rams highlights Vercel's 'eve' — announced 2026-06-17 — as an open-source…

Why it matters

@code_rams highlights Vercel's 'eve' — announced 2026-06-17 — as an open-source agent framework with a Next.js-style project layout: agent/ containing agent.ts, instructions.md, tools/, skills/, sandbox/, and schedules/

Key details

  • Vercel advertises eve's production features: durable execution, sandboxed compute, approvals, channels, and tracing (blog and tweet linked in the post)
  • @code_rams asserts building agents today 'feels like assembling furniture without instructions' and argues that if Vercel pulls this off, Eve will let any Next.js developer — not just AI researchers — build agents

Brief

Eve, Vercel's open-source agent framework announced on 2026-06-17, prescribes a Next.js-like project structure (agent/ with agent.ts, instructions.md, tools/, skills/, sandbox/, schedules/) and adds production features: durable execution, sandboxed compute, approvals, channels, and tracing. @code_rams claims Eve could turn agent-building from 'assembling furniture without instructions' into a repeatable workflow for any Next.js developer.

By @code_rams
ArXiv 2026-06-22 1 min read

Collapsed Effective Operators for Higher-order Structures

Why it matters

Introduces Collapsed Effective Operators (CEOs) that condense higher-order degrees of freedom into a single vertex-level operator via Schur complementation of a graded Laplacian; the resulting (generally dense) operator preserves positive semi-definiteness and satisfies a spectral upper bound relative to the rank-0 Hodge Laplacian, effectively lowering system energy under higher-order connectivity.

Key details

  • CEOs are applicable to arbitrary higher-order constructs and empirically improve spectral clustering and signal smoothing, while enabling topological features as positional encodings in neural architectures; paper by Maximilian Krahn, Lennart Bastian, Vikas Garg, Björn Schuller, and Tolga Birdal (arXiv:2606.23517v1), accepted at ICML 2026 and published 2026-06-22 (project: http://circle-group.github.io/research/CollapsedEffectiveOperators).

Brief

Collapsed Effective Operators (CEOs) address the fusion problem for higher-order spectral operators by Schur-complementing a graded Laplacian to produce a single vertex-level operator that encodes long-range, topology-mediated interactions. CEOs preserve PSD, give a spectral upper bound versus the rank-0 Hodge Laplacian, and empirically improve spectral clustering, signal smoothing, and positional encodings in neural networks. Full paper on arXiv and ICML 2026 acceptance.

Authors: Maximilian Krahn, Lennart Bastian, Vikas Garg...
ArXiv 2026-06-22 1 min read

FairBED: A Bayesian Experimental Design Approach to Gathering Fairer Data

Why it matters

Introduces FairBED (Marcel Hedman, Emily Alger, Brieuc Lehmann, Chris Holmes, Tom Rainforth): a fairness-aware Bayesian experimental design framework that quantifies dataset fairness by requiring datasets be uninformative about sensitive attributes and builds BED objectives to optimize data acquisition accordingly.

Key details

  • FairBED's objectives maximize expected information gain about target quantities while minimizing expected information gain about sensitive attributes, and the paper derives a theoretical link between FairBED and demographic parity.
  • Empirically, models trained on data gathered with FairBED yield improved fairness–accuracy trade-offs compared to randomly acquired data and conventional BED (arXiv:2606.23515v1; published 2026-06-22).

Brief

FairBED presents a fairness-aware Bayesian experimental design approach that quantifies dataset fairness by treating fair datasets as uninformative about sensitive attributes, then optimizes acquisitions to maximize expected information gain about target variables while minimizing gain about sensitive attributes. The authors derive a theoretical connection to demographic parity and report empirical improvements in fairness–accuracy trade-offs; summary based on the abstract (full text not reviewed).

Authors: Marcel Hedman, Emily Alger, Brieuc Lehmann...
Twitter/X 2026-06-23 1 min read

Author @beaverd (published 2026-06-23) says they want lots of money to build a…

Why it matters

Author @beaverd (published 2026-06-23) says they want lots of money to build a backyard warehouse containing petabytes of VRAM, an SLA 3D printer, car-sized CNC machines, an atmospheric 4000°C kiln, and a McLaren F1.

Key details

  • Post embeds a Formlabs tweet promoting the Fuse X1 SLS 3D printer, claiming next-day delivery of large parts with minimal stitching/gluing, lower cost, and industry-leading throughput — positioning SLS as a competitive alternative to injection molding.

Brief

Author @beaverd contrasts typical desires for wealth with a specific ambition to fund a backyard fabrication and compute warehouse (petabytes of VRAM, SLA printer, car-scale CNCs, a 4000°C kiln, plus a McLaren F1). The post also shares a Formlabs Fuse X1 promo highlighting fast, low-cost large-part SLS production that fits those maker ambitions.

By @beaverd
Twitter/X 2026-06-13 1 min read

On 2026-06-13 the US government issued an export-control directive suspending…

Why it matters

On 2026-06-13 the US government issued an export-control directive suspending access to Anthropic's Fable 5 and Mythos 5 for all foreign nationals worldwide, explicitly including foreign-national Anthropic employees.

Key details

  • Anthropic says it must abruptly disable Fable 5 and Mythos 5 for all customers to comply; other Claude models remain available. Anthropic calls the order a 'misunderstanding' and is working to restore access.
  • Author @code_rams reports personal access 'went dark' overnight and warns that reliance on US AI infrastructure lets government directives change your stack by morning, likely increasing calls to 'build sovereign'.

Brief

Anthropic announced on 2026-06-13 that a US export-control directive suspends Fable 5 and Mythos 5 for all foreign nationals worldwide, including foreign-national Anthropic employees, forcing the company to abruptly disable those models for all customers to comply. Other Claude models remain available; the author says access 'went dark' overnight and urges 'build sovereign.'

By @code_rams
Twitter/X 2026-06-15 1 min read

Author warns that 10 years of a company's expertise can be trained on by an AI…

Why it matters

Author warns that 10 years of a company's expertise can be trained on by an AI company and resold as a generic tool, erasing competitive advantage (cites Satya Nadella, tweet published 2026-06-15).

Key details

  • Three protections recommended: (1) build a 'learning loop' that trains AI on your own workflows and data, (2) own your institutional memory rather than just renting ChatGPT, (3) treat team knowledge as capital that compounds with AI you control.
  • Most companies will 'plug in' generic tools and call that AI transformation; winners will be those that actually own their AI rather than just use third-party models.

Brief

@code_rams warns (citing Satya Nadella's 2026-06-15 tweet) that a decade of company expertise can be absorbed by AI firms and resold as generic tools, erasing competitive edge. He prescribes three protections: build a learning loop on your workflows, own institutional memory (don't just rent ChatGPT), and treat team knowledge as capital—winners will own their AI.

By @code_rams
Garry's List 2026-02-07 5 min read

Boil the Ocean

Why it matters

Garry Tan (Garry's List, published 2026-02-07) argues that Artificial Superintelligence makes it time to “retire” the admonition to “don’t boil the ocean,” using an anecdote where a university endowment’s engineers were terrified after seeing Claude Code.

Key details

  • He reframes goals as engineering problems with concrete targets: examples include achieving 50% net IRR instead of 10%, startups delivering services 100x better than incumbents, and building products people would pay 10x for.
  • Tan invokes Buckminster Fuller’s 1938 concept of “ephemeralization” and Jevons Paradox to argue that dramatically greater efficiency in intelligence will expand demand, but this requires capital and management to raise ambitions rather than seek small efficiency gains.
  • Call to action: workers should “become builders” and management should pursue 10x+ aspirations; a critic (Nick DeMarco) warns this advice lacks a concrete transition plan for the large share of people who won’t or can’t make that jump.

Brief

Garry Tan argues that the arrival of Artificial Superintelligence is a signal to abandon incrementalism and pursue radically larger ambitions: instead of optimizing for 1–5% efficiency gains, founders and capital should solve engineering-scale problems (he cites targets like 50% net IRR vs 10% and services 100x better). He recounts a university endowment’s engineers’ fear after seeing Claude Code as evidence of the status-quo threat, then reframes the moment as an opportunity informed by Buckminster Fuller’s 1938 concept of ephemeralization and Jevons Paradox—greater efficiency in intelligence will drive far larger demand if management backs bold projects. Tan’s prescription: workers should become builders and leaders should aim for 10x outcomes rather than layoffs and marginal cuts. A reader comment (Nick DeMarco) cautions the piece lacks a plan for those who can’t transition to builder roles.

By Garry Tan
Twitter/X 2026-06-19 1 min read

@diviacaroline (posted 2026-06-19) recommends Manhattan Democrats who are…

Why it matters

@diviacaroline (posted 2026-06-19) recommends Manhattan Democrats who are undecided in the Democratic congressional primary talk with Eli Tyre (@EpistemicHope).

Key details

  • Eli Tyre says he works in AI policy full-time, is taking time off to volunteer 12+ hours/day to get Alex Bores elected, and is offering 15-minute conversations about AI risks and policy at talk-with-eli.pages.dev; he adds that his opinions are his own and his 501(c)(3) employer does not endorse candidates.

Brief

@diviacaroline urges Manhattan Democrats to speak with Eli Tyre (@EpistemicHope) if they’re undecided in the Democratic primary. Tyre, an AI policy professional who says he’s taking time off to volunteer 12+ hours/day to help elect Alex Bores, is offering 15-minute calls about AI risks, policy, and why voices like Bores belong in Congress (sign-up: talk-with-eli.pages.dev).

By @diviacaroline
Twitter/X 2026-06-08 1 min read

On 2026-06-08 Ramya Chinnadurai (@code_rams) outlined a 7-step stack for putting…

Why it matters

On 2026-06-08 Ramya Chinnadurai (@code_rams) outlined a 7-step stack for putting Claude on autopilot: 4 engine steps and 3 brake steps.

Key details

  • Engine steps: /loop (start in a throwaway session), promote (session → desktop → cloud), budget (cap tokens & match model per fire), /goal (give the loop a real stop condition). Brake steps: red-team the plan, ship-check outputs vs promises, scope permissions by cost to undo.

Brief

Ramya Chinnadurai (@code_rams) presents a 7-step blueprint for running Claude unattended that pairs an 'engine' (automation) with a 'brake' (safety). The engine covers /loop, staged promotion, token budgeting, and a concrete stop condition; the brake requires red‑teaming, output ship‑checks, and permission scoping so automated runs don’t create irreversible mistakes.

By @code_rams
Twitter/X 2026-06-23 1 min read

On 2026-06-23 @chamath argued companies should "own their 'edge'" by using a…

Why it matters

On 2026-06-23 @chamath argued companies should "own their 'edge'" by using a Software Factory to capture expert and tribal knowledge — pointing to 8090.ai and @8090_Factory (bit.ly/4eGMgFQ) as an example.

Key details

  • Captured knowledge is treated as an executable "north star": changing the knowledge auto-updates software/actions, and observed behavior produces redlines back to the knowledge so teams can approve exceptions and trace deviations; Chamath calls this a way to make AI productively available to everyone.

Brief

Chamath recommends companies preserve their competitive edge by uploading expert and tribal knowledge into a "Software Factory" (citing 8090.ai/@8090_Factory). He claims this makes that knowledge executable software, so updates change behavior automatically and behavioral deviations generate redlines to approve exceptions and explain why deviations occur, framing the model as broadly productive AI.

By @chamath
Twitter/X 2026-06-23 1 min read

@dwallacewells (2026-06-23) asserts that climate policy must place as much…

Why it matters

@dwallacewells (2026-06-23) asserts that climate policy must place as much emphasis on adapting to warming "already locked in" as on mitigation, and that "air-conditioning in most locations" should be regarded as a right.

Key details

  • Leigh Phillips reposted the point amid a new European heat dome, calling it a seasonal "shilling for Big Air Con" and linking a 2018 Jacobin essay ('In Defense of Air-Conditioning') which argues opposition to AC is austerity politics and that working-class people deserve freedom from heat.

Brief

David Wallace-Wells (2026-06-23) argues adaptation must match mitigation and that air-conditioning should be treated as a right in most places. Leigh Phillips echoed this during a fresh European heat dome, reposting a 2018 Jacobin piece that frames opposition to AC as austerity politics and defends AC as a working-class necessity.

By @dwallacewells
Twitter/X 2026-06-23 1 min read

France recorded a peak of 44.6°C (112°F) in Bordeaux on 2026-06-23; Jeff…

Why it matters

France recorded a peak of 44.6°C (112°F) in Bordeaux on 2026-06-23; Jeff Berardelli labels it a 4.2σ event and calculates a 1-in-87,000-year return interval against the historical station distribution, but says that estimate is nonsensical because the value lies far beyond the station's all-time and June records.

Key details

  • Berardelli asserts the heat spike is "virtually impossible without climate change" and that in today's hotter climate such extremes "appear to be 'just another Tuesday'" — concluding "it's not coincidence, it's climate change."

Brief

Jeff Berardelli reports Bordeaux hit 44.6°C (112°F) on 2026-06-23, a 4.2σ anomaly that nominally implies a 1-in-87,000-year return period — a number he warns is unreliable because it lies well beyond the station's records. He argues the event is virtually impossible without climate change and is becoming routine in the current climate.

By @dwallacewells
Twitter/X 2026-06-23 1 min read

Dreamina Seedance 2.0 4K is live on Dreamina AI WEB as of 2026-06-23…

Why it matters

Dreamina Seedance 2.0 4K is live on Dreamina AI WEB as of 2026-06-23 (announcement via @dreamina_ai).

Key details

  • Technical specs: 4K precision (3840×2160 UHD), high-bitrate color transitions, and claimed ultra-realistic detail (hair to lighting) targeted at professional post-production and brand visuals.
  • Initial regional rollout covers Southeast Asia, the Middle East, Africa, Europe, and South America; additional regions will be added.

Brief

Dreamina Seedance 2.0 4K launched on Dreamina AI (web) on 2026-06-23, offering 4K precision (3840×2160 UHD), high-bitrate color transitions, and claimed ultra-realistic detail from hair to lighting for professional post-production and brand visuals. The release is rolling out across Southeast Asia, the Middle East, Africa, Europe, and South America, with more regions promised.

By @ginacostag_
Twitter/X 2026-06-23 1 min read

Yes& is a new social platform (yesand.ai) from Lena (@lena_z01) and Markus…

Why it matters

Yes& is a new social platform (yesand.ai) from Lena (@lena_z01) and Markus (@markusmak12) that turns saved inspiration into remixable starting points, with lineage and credit baked into every remix.

Key details

  • The platform relies on AI to let users convert camera-roll images, Pinterest/TikTok bookmarks, and other inspiration into creations, making creation social through remixing and co-creation.
  • On 2026-06-23 the founders announced $3M in pre-seed funding led by Accel, with support from Parable VC and other partners to build the collaborative- creativity infrastructure.

Brief

Yes& is a social-creation platform from Lena Z (@lena_z01) and Markus M (@markusmak12) that uses AI to transform saved inspiration (photos, Pinterest, TikToks) into remixable projects while preserving lineage and credit. Launched publicly on 2026-06-23, the team raised $3M in pre-seed funding led by Accel, positioning the product around social remixing and co-creation.

By @hasantoxr
Twitter/X 2026-06-23 1 min read

@hasantoxr announced KroWork (KroworkAI) v0.9.X on 2026-06-23, saying it reached…

Why it matters

@hasantoxr announced KroWork (KroworkAI) v0.9.X on 2026-06-23, saying it reached that release after one month and five shipped versions and converts natural language into real desktop apps you can run locally, share with one click, and keep without burning tokens on reruns.

Key details

  • KroWork 0.9.X features: 'Intelligent Apps' (software with built-in AI), one‑click app sharing, multimodal capability, and support for the latest models; the author frames it as 'the next evolution after agents.'

Brief

KroWork (KroworkAI) is presented as a tool that turns natural language into persistent, portable desktop apps: version 0.9.X was announced on 2026-06-23 after one month and five releases. It emphasizes built-in AI 'Intelligent Apps,' one-click sharing, multimodal input, latest-model support, and no token costs on reruns, positioned as the next step beyond agents.

By @hasantoxr
Twitter/X 2026-06-23 1 min read

On 2026-06-23 Niels Klement (@nielskle) posted (via @hasantoxr) that 'vibe coding…

Why it matters

On 2026-06-23 Niels Klement (@nielskle) posted (via @hasantoxr) that 'vibe coding funnels is making marketers broke' and promoted Perspective MCP as the solution.

Key details

  • Perspective MCP is claimed to turn Anthropic's Claude into an end-to-end funnel machine that handles strategy, build, tracking, CRM, and auto-optimization from a single chat, deploying a live-converting funnel on your domain in minutes.
  • The product is advertised as 'built on funnels behind $1B in ad spend,' positioning it on the experience and scale of enterprise ad operations.

Brief

Perspective MCP is presented as a Claude-powered tool that automates end-to-end funnel creation—strategy, build, tracking, CRM, and auto-optimization—from a single chat, delivering live-converting funnels on your domain in minutes. Niels Klement (@nielskle) framed this on 2026-06-23 as the fix for 'vibe coding' funnels and cites roots in funnels behind $1B in ad spend.

By @hasantoxr
Twitter/X 2026-06-23 1 min read

Dreamina Seedance 2.0 4K went live on Dreamina AI on 2026-06-23; it delivers…

Why it matters

Dreamina Seedance 2.0 4K went live on Dreamina AI on 2026-06-23; it delivers 3840×2160 UHD output intended for professional post-production and brand visuals.

Key details

  • The release touts ultra-realistic detail—precise lighting, high-bitrate color transitions, and 'flawless texture' in every frame, with specific mention of hair and lighting clarity.
  • Initial rollout covers Southeast Asia, the Middle East, Africa, Europe, and South America via Dreamina AI Web; more regions are planned.

Brief

Dreamina Seedance 2.0 4K is now available on Dreamina AI (announcement posted 2026-06-23), offering 3840×2160 UHD output and marketed for professional post-production and brand work. The product emphasizes precise lighting, high-bitrate color transitions, and detailed textures (including hair/lighting), and is live on Dreamina AI Web across several global regions.

By @hasantoxr
Garry's List 2026-06-23 8 min read

A Third of LA's Affordable Housing Is Out of Compliance

Why it matters

City Controller Kenneth Mejia’s performance audit (released June 5, 2025, covering 2020–2023) found 33% of LA’s affordable-housing properties noncompliant in 2023 — 13% with active violations (e.g., rents over LAHD limits, tenants over income limits) and 20% failing to submit required documentation; noncompliance rose from 27% in 2021 to 33% in 2023.

Key details

  • LA Housing Department holds a $2.9 billion loan portfolio covering roughly 47,000 affordable units across 1,600 properties but has no annual financial-monitoring process for projects (including HOME-funded); LAHD collected about $29 million in FY2022–23 and was missing ~170 of 700 (25%) project financial statements due in 2023.
  • Inspectors documented mold and roach infestations during audit site visits (including senior housing and HOME-funded projects) but lacked written HOME-based inspection procedures and authority/application to cite health hazards; LAHD left pamphlets or failed to refer cases because County referrals require tenant contact info.
  • Enforcement and coordination failures: LAHD made 11 City Attorney referrals in 2022 and zero in 2023; of 179 "Non-Submission" properties, LAHD followed up on 27 (15%) and only 3 became compliant (<2% resolution); different LAHD units provided inconsistent HOME project counts (518 vs. 353), indicating siloed data systems.

Brief

Los Angeles’ affordable-housing oversight is deeply fragmented: a June 5, 2025 audit by City Controller Kenneth Mejia (reviewing 2020–2023) found 33% of properties noncompliant in 2023 and chronic inspection and enforcement gaps. LAHD manages a $2.9 billion loan portfolio for ~47,000 units but lacks an annual financial-health monitoring process required for HOME-funded projects, collected ~$29 million in FY2022–23, and missed 170 of 700 required 2023 financial statements. Inspectors documented mold and active roach infestations at multiple sites but had no HOME-based written procedures to cite health hazards and often only left tenant pamphlets; the SCEP inspection cycle begun in 2019 remains incomplete, with ~27,000 of 107,000 rentals waiting for inspection. The audit highlights siloed units (inconsistent project counts), near-zero escalation to the City Attorney in 2023, and recommends risk-based monitoring and better use of existing data to flag at-risk properties.

By Garry Tan
Garry's List 2026-02-20 4 min read

Red Robin Died by Spreadsheet. Don't Make the Same Mistake.

Why it matters

Red Robin’s stock collapsed ~96%, falling from a 2015 high of $92.90 to about $3.61 after management cuts beginning in January 2018 under CEO Steve Carley (notably firing all bussers and removing expeditors).

Key details

  • Operational fallout included a revenue peak of $1.4B across 573 locations in 2017, a reported 85% year‑over‑year increase in walkaways, 75% of dine‑in traffic loss occurring at peak hours, and average ticket times rising by ~1 minute; comparable revenue was down 1.2% for 2024.
  • Chili’s, under Kevin Hochman from 2022, simplified the menu, invested in operations and ran a $10.99 viral TikTok deal, driving ~31% same‑store sales growth; market caps now contrast ~ $65M for Red Robin vs ~$3.3B for Chili’s (~50x).
  • Author Garry Tan’s prescription for the AI age: avoid short‑term cost cuts; pursue ambitious, 10x product/service improvements (invoking Jevons Paradox) instead of incremental 5% efficiency gains that risk a race to the bottom.

Brief

Red Robin’s decline is traced to a January 2018 operational decision under CEO Steve Carley to eliminate bussers, expeditors and kitchen manager roles — a spreadsheet‑driven cost cut that preceded a cascade of second‑order effects. After a 2015 peak share price of $92.90 and revenue topping $1.4B across 573 locations in 2017, the chain saw walkaways rise 85% YoY, 75% of dine‑in losses concentrated at peak hours, and average ticket times increase by roughly one minute, contributing to a ~96% stock collapse to about $3.61 and comparable revenue down 1.2% in 2024. By contrast, Chili’s (Kevin Hochman, 2022) simplified the menu, invested in operations and launched a $10.99 viral promotion, producing ~31% same‑store sales growth and a ~$3.3B market cap versus Red Robin’s ~$65M. Tan argues the strategic lesson for the AI era is to ‘do more’—use efficiency to expand products and demand (Jevons Paradox) rather than pursue short‑term labor cuts.

By Garry Tan
ArXiv 2026-06-22 1 min read

CoorDex: Coordinating Body and Hand Priors for Continuous Dexterous Humanoid Loco-Manipulation

Why it matters

CoorDex converts high-DoF whole-body and a 20-DoF WUJI hand into coordinated latent residual control on a Unitree G1 humanoid, demonstrating continuous on-the-move dexterous tasks (non-stop bottle grasp-and-carry, fridge-door opening while walking, cube pick-and-turn).

Key details

  • Training pipeline: simulated whole-body/hand demonstrations -> privileged motion-tracking teachers -> distilled proprioception-conditioned latent priors (frozen as the RL action space) -> coordinated latent residual policy with shared task context and separate body/hand residual heads.
  • Ablations on the walk-grasp-carry task show joint-space PPO, joint-space hand control, and monolithic latent prediction fail under the same reward budget, while the latent-prior interface plus coordinated residual structure enables successful training.

Brief

CoorDex presents a pipeline that distills simulated whole-body and hand demonstrations into proprioception-conditioned latent priors, freezes those priors as the action space, and trains a coordinated latent residual policy with separate body/hand residual heads. This enables continuous, contact-rich loco-manipulation on a Unitree G1 with a 20-DoF WUJI hand (bottle grasp/carry, fridge opening, cube manipulation); ablations show the coordinated latent approach is necessary where joint-space and monolithic baselines fail.

Authors: Sikai Li, Shuning Li, Zhenyu Wei...
ArXiv 2026-06-22 1 min read

Semantic Browsing: Controllable Diversity for Image Generation

Why it matters

Semantic Browsing (Dorfman et al., arXiv:2606.23679v1; ECCV 2026) introduces a controllable diversity method that produces structured, navigable image galleries by inducing variation at the text level rather than via stochastic sampling in the text-to-image model.

Key details

  • The approach leverages elaborated captions from T2I training data and a Vision–Language Model operating over full scene context with an agentic workflow to generate meaningful, user-understandable axes of variation instead of incidental pixel-level differences.

Brief

Semantic Browsing addresses diversity collapse in text-to-image generation by shifting diversity induction from the image model to the text level. The authors exploit elaborated captions and a Vision–Language Model that reasons over full scene context, combined with an agentic workflow, to produce structured, interpretable axes of variation. The result is navigable design spaces where each variation corresponds to a specific semantic decision (arXiv:2606.23679v1; ECCV 2026).

Authors: Sara Dorfman, Maya Vishnevsky, Omer Dahary...
ArXiv 2026-06-22 1 min read

TailorMind: Towards Preference-Aligned Multimodal Content Generation

Why it matters

TailorMind produces personalized multimodal content that improves novelty and aesthetic quality over representative generation baselines and even ground-truth UGC, while achieving competitive or stronger coherence; experiments report up to 29% Recall gains in reranking.

Key details

  • TailorMind combines hypergraph collaborative filtering to enrich sparse user histories with textual-profile optimization using ranking-error feedback and textual gradient descent, plus retrieval-augmented style control and cross-modal cohesion reflection; evaluated on TailorBench (three mainstream platforms, five axes: coherence, novelty, aesthetic, hallucination, profiling).

Brief

TailorMind addresses personalized multimodal content generation when suitable user-generated content is absent by linking collaborative preference modeling with controllable multimodal generation. It enriches sparse histories via hypergraph collaborative filtering, refines textual profiles with ranking-error feedback and textual gradient descent, and uses retrieval-augmented style control plus cross-modal cohesion reflection. On TailorBench (three platforms, five evaluation axes) it improves novelty and aesthetic quality and yields up to 29% reranking Recall gains.

Authors: Hengji Zhou, Ye Liu, Yufeng Liu...
ArXiv 2026-06-22 1 min read

Learning Process Rewards via Success Visitation Matching for Efficient RL

Why it matters

Proposes a 'success visitation matching' method: train a discriminator to distinguish successful vs unsuccessful episodes and use it to reward an RL policy for matching the state-action visitation distribution of successful episodes while avoiding unsuccessful ones; authors prove this dense process reward does not change the optimal policy.

Key details

  • Evaluated on finetuning robotic control policies (both simulated and real-world manipulation) and reported significantly faster RL finetuning than directly maximizing the sparse outcome (+1 on success) reward; paper by Raymond Tsao, Andrew Wagenmaker, and Sergey Levine (arXiv:2606.23640v1), published 2026-06-22.

Brief

Learning Process Rewards via Success Visitation Matching addresses sparse outcome rewards by training a discriminator to separate past successful and unsuccessful episodes, then shaping a dense reward that incentives matching state-action visitations of successes. The approach provably preserves the original optimal policy and yields substantially faster finetuning of robotic control policies in both simulation and real-world manipulation. Full text was not available (abstract source).

Authors: Raymond Tsao, Andrew Wagenmaker, Sergey Levine