Show HN: SlimSnap – mark a screenshot element, get JSON for your coding agent
SlimSnap: Convert screenshot annotations to JSON for coding agents (Claude, Aider, Codex). Enables agents to process UI visuals.
SlimSnap: Convert screenshot annotations to JSON for coding agents (Claude, Aider, Codex). Enables agents to process UI visuals.
TurboPrefill: 2.7× faster LLM inference on Llama-3-70B via optimized pipeline parallelization and prefill scheduling mechanisms.
Supafax: Agent using email as file system for memory and configuration. Email-native interface for agent task execution and persistence.
Discussion on whether ASICs will emerge for AI training/inference similar to crypto mining.
Self-hosted GitHub-compatible Git service designed as agent-first with durable identities, scoped tokens, and AI agent as first-class citizens.
GitLab research shows AI coding tools improve speed but don't accelerate overall delivery due to testing/review bottlenecks and governance challenges.
Analysis of risks in marketing AI agents as coworkers, focusing on human error detection and accountability concerns.
Theoretical analysis of Adam optimizer for time-varying and nonstationary optimization problems.
ML pipeline (UBP-CAP) for student performance prediction and metacognitive calibration in intelligent tutoring systems.
Introduces WildChat benchmark for multi-agent routing as set-valued prediction problem with 3000 prompts and cost-aware evaluation.
Proposes DLR, a training-only plug-in for low-rank LLM pre-training that reduces parameters and FLOPs without inference cost.
Introduces ReGuide for improving behavior-cloned diffusion policies through test-time guidance and self-improvement mechanisms.
Proposes Modification-Considering Value Learning to mitigate reward hacking in RL by detecting task violations during policy learning.
Characterizes when conformal risk control can certify LLM outputs for structured generation tasks and proposes adaptation methods.
Shows tabular foundation models cannot reason about system-generated data without access to underlying rules, introducing Operational Turing Test.
Proposes DiLaServe system for efficient serving of diffusion language models while meeting latency SLOs through parallel token generation.
Studies how token influence decays with distance in transformer LMs using green-function analysis from differential equations, inspired by operator learning.
Empirical study examining non-linear learning rate scaling laws for LLM training across model sizes 22M-707M parameters.
Study of latent reasoning trajectories in language models, showing low-rank structure in contrastive refinement signals between reasoning paths.
Framework for attributing training data to interpretable symbolic policies in language models using Ridge regression over mechanistic circuits.
BaRA: Bayesian adaptive rank allocation for LoRA fine-tuning; dynamically optimizes rank per layer for uncertainty calibration.
Analysis of evaluation-awareness in language models across scales; shows systematic shift in layer depth of test-detection representation.
Multi-Block Diffusion extends block diffusion language models with concurrent multi-block decoding and inter-block parallelism.
Depth Exploration for LLM decoding: exploits varying token predictability depths to accelerate inference beyond single-exit methods.
Analysis of Group Relative Policy Optimization revealing credit assignment failure and gradient sparsity from policy gradient first principles.
Methodological framework for evaluating data-generating priors as independent components in tabular foundation models.
KrishokChat: citation-grounded Bengali agricultural instruction-tuning dataset with 290 knowledge nodes for crop advisory in low-resource settings.
Adaptive Block Diffusion resolves training-inference mismatch in diffusion language models by optimizing over variable context configurations.
Study of intervention bias in LLM educational advisory agents using RAG pipeline; demonstrates models recommend action when inaction optimal.
Federated learning method (SP-CACW) for personalized client objectives with convergence-aware weighting to avoid negative transfer.
PAC learning analysis of sample complexity for symbolic regression via compositional function trees.
Randomized neural operator combining PCA and fixed random features for fast training of parametric PDE solvers.
LLM4MOF framework where language model agents autonomously design metal-organic frameworks through closed-loop reasoning and simulation.
Theoretical and empirical analysis of proper loss geometries and curvature effects in multiclass classification objectives.
Self-distilled agentic RL method using counterfactual credit assignment from sibling rollouts to improve token-level learning.
Study showing LLM confidence reports correlate more with commitment than correctness, questioning their use as uncertainty measures.
Empirical evaluation comparing Q-Learning, SARSA, Monte Carlo, and DQN algorithms on Super Mario Bros World 1-1.
Theoretical analysis of why recurrent networks struggle with long-range dependencies and how multi-time-scale learning emerges.
Priority-Constrained Descent algorithm for multi-objective optimization with inherent hierarchies in deep learning.
Experimental analysis testing whether model scratchpad outputs causally influence later computation in chain-of-thought reasoning.
Study of training-inference mismatch in LLM reinforcement learning and proposal for monotonic inference policies to improve stability.
Analysis showing optimizer memory makes shuffle order a significant source of fine-tuning noise in model training.
Optimization technique for inference servers to decode stateful sessions off the critical path without draft models.
Factorial analysis of how quantization and sampling temperature jointly affect LLM safety alignment during deployment.
Bilevel optimization framework for Neural Architecture Search: hierarchical approach for NAS, hyperparameter tuning, meta-learning with arXiv research.
STEMGym: open-source benchmark for sequential decision-making in autonomous electron microscopy under dose constraints using RL/Bayesian approaches.
AI models helped determine worst-case complexity of the 1937 Kaczmarz algorithm, foundational to modern SGD used in training ChatGPT and Gemini.
Causal Perturbative Elicitation discovers interpretable low-rank adapters (LoRAs) that surface latent behavioral modes in LLMs for risk evaluation and behavior reshaping.
Investigates whether role-based expert specialization in Mixture-of-Experts architectures preserves explanation faithfulness and interpretability.
Fuzzing LLM weights and activations with Gaussian noise to systematically elicit hidden backdoored behaviors in 7B-13B models without knowing triggers.