optimization

The article explains why tiny JPEGs can look different in Chrome compared to other browsers, due to a JPEG decoding optimization that skips high-frequency DCT coefficients during heavy downscaling.

The article introduces a fine-tuned Automatic1111 fork for Apple Silicon that adds Metal optimizations (e.g., Metal Flash Attention) to speed up Stable Diffusion 1.5 generation, cutting times from 8-10s to 3-7s on an M3 Pro and from 13-20s to 8-10s on an M1 Mac Mini.

This paper proposes a method to accelerate DNN training for high-dimensional functions by introducing contextual features, including rank-1 features and tensor features from decomposed pretrained DNNs, using randomized tensor decomposition to reduce storage costs by orders of magnitude.

Introduces Boundary-Seeking Policy Gradient (BSPG), a first-order method for safe reinforcement learning that actively drives the policy toward the constraint boundary, with convergence guarantees and improved reward/boundary tracking on a Safety-Gymnasium task.

This paper studies how information in tool documentation affects LLM agent performance across different settings, and proposes DocsChisel, an adaptive framework that iteratively optimizes tool documentation to improve task success rates.

A theory paper introducing Decoupled Descent (DD), a training method that uses approximate message passing Onsager corrections to enforce asymptotic equality between training and test error during gradient descent, potentially enabling better stopping and hyperparameter tuning.

This paper proposes a hybrid nested search framework that decouples structural sketching (by an LLM) from numeric parameter optimization (by traditional solvers like CMA-ES) in LLM-driven evolutionary optimization, and validates it across meta-optimization, code-based policies, and Bayesian inference tasks.

This paper theoretically analyzes support selection in continuous DAG learning, showing that smooth acyclicity constraints alone cannot rank supports beyond feasibility and deriving selection times for NOTEARS/DAGMA, with empirical audits on 320 trajectories.

Presents LibraSpec, a training-free, plug-and-play algorithm that dynamically selects speculative decoding lengths via marginal-gain-driven optimization, achieving consistent speedups across multiple models and benchmarks.

This paper shows that steering vectors' safety degradation is separable and reducible, proposing a post-hoc correction via constrained optimization that restores model safety while preserving steering effectiveness.

This paper presents the first application of program embeddings from LLMCompiler, an LLM pretrained on IR code, to program analysis and optimization tasks, achieving a 1.54% error rate in algorithm classification and competitive accuracy on heterogeneous device mapping.

This paper introduces KappaSharp, a method for condition-number shaping in Preferential Bayesian Optimization that corrects the ill-conditioned Hessian from isolated pairwise comparisons, showing up to +10.9% improvement over the standard PairedGP/EUBO baseline on 11 benchmarks including plasma medicine controller tuning.

A technical blog post explains how to perform integer division and remainder using floating-point division and fused multiply-add, with constraints on operand bit widths, and discusses practical considerations for SIMD and rounding modes.

Klaus Post discusses the process of rebalancing deflate compression levels in the Go compression library to make speed/compression trade-offs more linear and intuitive.

Meta announces a new open-source model optimized for on-device deployment, aiming to bring efficient AI inference to edge devices.

The paper introduces NS-RIS, a scalable Newton-Schulz retraction-based algorithm for learning hidden quantum Markov models on the Stiefel manifold, providing the first mathematical performance guarantee and empirical evidence that HQMMs can outperform EM-trained HMMs on non-quantum-generated data.

Introduces CEDAR, an autonomous method that uses LLM agents with Monte Carlo Tree Search to discover complex systems satisfying user-specified behavioral goals, reducing human effort and enabling goal-directed design.

This paper presents a deep reinforcement learning approach for solving vehicle routing problems, demonstrated through three industrial truck planning case studies. The proposed method achieves over 10% cost reduction compared to baseline results and discusses generalization to more VRP variants.

The author shares an agent-design-review Skill for systematically diagnosing and optimizing Agent architectures, covering Prompt, tool permissions, context, security, memory, evaluation, cost, observability, and more, and outputting evidence-based P0/P1/P2 issues to help avoid common pitfalls.

A deep-dive educational article exploring dynamic programming as a unifying principle behind shortest-path algorithms, neural network training, and context-free grammar parsing, tying together automata, optimal control, and linear programming.