optimization

The article highlights the paper 'A Gentle Introduction to Matrix Calculus' by Jan Magnus, published in the Journal of Econometrics in 2024, as a clear and valuable resource for fields like econometrics, machine learning, statistics, and optimization.

A tweet advising owners of NVIDIA's DGX Spark to prioritize using nvfp4 for optimal performance.

The article explains how RuneScape in 2004 optimized data transfer to fit a multiplayer RPG on 56k dial-up modems, detailing network constraints, encryption, and client decompilation.

This MIT paper introduces a mathematical framework for a unified representation of deep learning architectures, enabling automated analysis and optimization. It aims to replace manual design with a common language that can generate diagrams, graphs, or PyTorch code.

This paper presents a systematic machine learning study of 6G-IoT beamforming optimization, comparing network, environmental, device, and vision feature groups for predictive power, and applying clustering methods to enhance performance.

This paper introduces an ADMM-inspired momentum framework (AIM) and a new optimizer RADAR, offering a theoretical interpretation of momentum as a residual-driven multiplier correction, with experiments showing consistent gains over strong adaptive baselines.

Introduces 'Training Under Challenge', an executable-certificate framework that uses architecture-valid procedures to construct alternative models and estimate the empirical global-optimality gap of neural network checkpoints, with theoretical guarantees and experiments on ResNet-18 distillation and quantized denoising.

This paper analyzes when random low-dimensional reparameterizations can train neural networks, deriving an orientation-resolved master formula for the random-slice residual and introducing RaMaN, a scalable framework that predicts required latent dimensions while dramatically reducing memory costs.

The paper introduces ε-MemEvo, a framework for cross-task knowledge transfer in LLM-based program evolution, storing tactic memories as natural-language summaries and using an adaptive injection gate. It reports consistent gains on 8 optimization benchmarks with less than 1% computational overhead.

A deep dive into Ruby's internal ar_table structure for small hashes, explaining the linear lookup mechanism and exploring potential optimizations.

An essay arguing that NP-hard problems are often not as intractable in practice as commonly believed, citing modern solvers and algorithmic advances that handle real-world instances efficiently.

This paper proposes a new asymmetric robust bounded sparse smooth (aR) loss function for l1-norm penalized geometric twin support vector machine (aRSGTSVM) to handle classification and regression tasks with label and feature noise, achieving feature selection and robustness. Experiments on synthetic and UCI datasets plus China stock market index tracking demonstrate superiority.

This paper introduces PAIR, a pairwise-aware inclusion reweighting method for adaptive rollout allocation in RLVR, improving sample efficiency and accuracy over pointwise allocators by correcting biases in pairwise gradient estimation.

This paper proposes Adaptive Hybrid PSO (AHPSO), which uses a sigmoid function on swarm diversity to automatically modulate gradient influence during search. Results show it outperforms standard PSO and rivals CMA-ES on certain problem classes, but the advantage is not universal.

This paper introduces the edge-based contiguous p-median (ECpM) problem for partitioning road networks into compact territories, proposing two binary programming models with contiguity constraints and testing them on large road networks. The shortest-path constraint model achieves significant speedups over a cut set-based branch-and-cut approach, with connections to logistics districting.

This paper introduces P&ID Pilot, an end-to-end AI pipeline combining genetic algorithms and LLMs to generate optimal process flow diagrams (PFDs) and transform them into validated piping and instrumentation diagrams (P&IDs), reducing manual engineering effort.

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.