Tag
The author draws parallels between the early microservices hype and current multi-agent system hype, arguing that engineering practices—not better models—may be the key to reliable multi-agent systems.
This paper investigates how well sharpness and complexity together explain generalization in deep neural networks, introducing a Pareto-based analysis and function-oriented definitions to expand the explanatory scope.
麻省理工学院教授、哥德尔奖得主瑞安·威廉姆斯在一期播客中深入讨论了算法优化、细粒度复杂性理论以及强指数时间假说等前沿计算机科学话题。
A developer shares frustration with multi-agent systems, noting they are more complex than single-agent systems and often produce worse results, and asks for advice on coordination and tools to reduce complexity.
The article discusses how LLMs have grown increasingly complex, moving beyond simple transformer stacks to incorporate diverse attention variants, mixture-of-experts, and multimodal encoders, drawing parallels with recommendation systems and emphasizing the need for composable kernel optimization like FlexAttention.
An opinion piece arguing that tech CEOs are deluded into thinking they can automate away their workforce with Generative AI, but complexity cannot be eliminated and human needs require friction.
This paper proposes a framework for evaluating LLMs' ability to generate multiple responses to scientific queries at different language complexity levels. The study finds that models often vary complexity inconsistently, with Claude Sonnet 4.5 performing best but only shifting complexity correctly 46% of the time.
Introduces ComplexityMT, a benchmark for evaluating the interaction between text complexity and machine translation across six languages using CEFR levels, showing that higher complexity makes translation harder and that MT shifts complexity levels.
Carson Gross (htmx creator) argues that while AI has made code generation cheaper, understanding code has become more expensive, and warns developers against the 'Sorcerer's Apprentice' trap of letting LLMs generate unmanageable complexity. He advocates for incremental LLM use and maintaining deep understanding of codebases.
A reflective article questioning the casual assumption that building AI agents is easy, highlighting the complex components like APIs, RAG, tool calling, memory, and orchestration, and suggesting that simpler workflows often suffice before needing true agents.
Discusses challenges with coding agents in complex long-horizon tasks, highlighting bizarre user experience issues and inefficient agent interactions, and advocates for more control over the agent harness.
A user reflects on the complexity and fascination of running local LLMs, touching on hardware selection, quantization, and tensor parallelism.
A Codex skill that analyzes codebases to identify performance hotspots such as loops, repeated lookups, and N+1 patterns.
An opinion piece arguing that modern society and technology have made life unnecessarily complicated, critiquing the promise of AGI as a savior and suggesting a return to simplicity.
Senior developers often fail to communicate effectively with business teams because they overemphasize code complexity, while business teams truly care about eliminating uncertainty. The article suggests developers use "Can we try a faster approach?" to align both sides, and points out that although AI can write code quickly, humans still take responsibility.
This paper analyzes the size complexity and decidability of first-order progression in the Situation Calculus, showing that for local-effect, normal, and acyclic actions, progression grows polynomially and remains within decidable fragments such as two-variable first-order logic.