Search: “machine-learning”

Design Docs Are All You Need: An AI-native Machine-Learning Performance Tool

Researchers present SMART, an ML performance-modeling library regenerated by AI coding agents from natural-language design docs instead of code.

The paper describes SMART, a symbolic performance-modeling library whose main branch contains almost no code: the repository is a DAG of self-contained design documents, and coding sub-agents regenerate implementations from only the docs on version updates. Reliability rests on a worked-example doc style used as in-context demonstrations and a minimal operator IR with SymPy cost expressions, offering both fast analytical roll-up and fine-grained modulo-scheduling modes. Regenerated implementations reproduce hand-audited reference models, including DeepSeek-V3 serving on a TPU pod slice, to round-off precision.

arXiv cs.AI / cs.LG / cs.CL·Sep 4, 17:08 UTC · 11d agoAI research1

Sound Debloating of Redundant Checks in Zero-Knowledge Machine-Learning Circuits

Automated framework soundly removes up to 48.7% of redundant constraints in ezkl and zkml ZK-ML circuits, cutting prover time by up to 72.8%.

The framework uses whole-circuit abstract interpretation and a provenance graph to verify that each removed redundant check (range proofs, sign lookups, bit decompositions) remains entailed by the rest of the circuit, provably preserving soundness. It was evaluated on MLP, CNN, RNN, and transformer circuits generated by ezkl and zkml, with up to 25.3 million constraints. It removes up to 48.7% of constraints and reduces prover time by up to 72.8% without weakening security. Under-constrained circuits in deployed ZK systems have previously enabled attackers to forge transactions and bypass verification.

arXiv cs.CR·Sep 9, 13:27 UTC · 6d agoResearch1

Why don't machine learning research agents overfit?

Amazon researchers explain why ML research agents avoid benchmark overfitting, attributing generalization to compressibility of successful strategies.

Amazon Science summarizes the paper "What fits (into few tokens) doesn't overfit: Compression and generalization in ML research agents," which investigates why benchmark hill-climbing loops, whether run by human communities or LLM research agents, do not produce rampant overfitting. The explanation formalizes Occam's razor via a counting argument: successful ML strategies are highly compressible, so short descriptions lack room to memorize benchmark data and must capture real structure. LLM-based agents, being resettable and controllable, allow this hypothesis to be tested empirically.

Hacker News · security·Sep 14, 16:32 UTC · 1d agoAI researchHN 21↑ · 3 comments

ConvMem: Convolutional Memory for Long-Context Reasoning

Researchers propose ConvMem, a training-free framework treating LLMs as convolutional kernels for parallelizable long-context reasoning beyond fixed context windows.

ConvMem reformulates long-context reasoning as a hierarchical convolution in which the LLM summarizes text segments hierarchically, shortening the reasoning path from a linear chain to a logarithmic tree. It uses configurable strides, skip connections, and multi-kernel convolution to capture evidence, decompose queries, and enable massive parallelization across segments and reasoning threads. On RULER-HotpotQA and RULER-2WikiMultiHopQA it outperforms training-free baselines and avoids the out-of-distribution overfitting seen in RL-trained approaches like MemAgent.

arXiv cs.AI / cs.LG / cs.CL·Sep 9, 16:53 UTC · 6d agoAI research

Nebulon Enterprise Simulated Threats for Phishing Research (NEST-Phish): A Synthetic Enterprise Phishing Email Dataset for Behavioral and Machine-Learning Research

Researchers release NEST-Phish, a synthetic enterprise phishing email dataset with matched legitimate and phishing emails and cue annotations for detection research.

Academic researchers introduce NEST-Phish, a publicly released synthetic enterprise phishing email dataset built around a fictitious organization named Nebulon. It contains matched synthetic legitimate and phishing emails across a broad set of workplace communication themes, each with interpretable phishing-cue annotations. Human-subject categorizations and supervised classifier evaluations indicate the dataset supports meaningful variation in phishing judgments and provides learnable signal for detection models. It is intended to support work on phishing detection, human susceptibility, explainability, and benchmark development.

arXiv cs.CR·Sep 3, 20:58 UTC · 12d agoResearch

Learning Sparse Decision Trees via Transformer Variational Auto-Encoders

TREVIS uses a Tree Transformer VAE latent space to learn decision trees matching near-optimal predictive performance while improving structural sparsity.

TREVIS learns decision trees optimized for complex objectives by exploring the latent space of a Tree Transformer Variational Auto-Encoder (TTVAE). Mapping trees to continuous latent representations replaces the discrete search space with a continuous one, enabling gradient-based optimization through a differentiable surrogate model. Experiments show TREVIS matches the predictive performance of near-optimal algorithms while improving structural sparsity, targeting high-stakes contexts needing transparent decision logic.

Hugging Face daily papers·Aug 31, 20:00 UTC · 15d agoAI research

Hackers Exploit Marimo RCE to Steal AWS Credentials and Reach Bastion Host in 8 Seconds

Attackers exploited pre-auth RCE CVE-2026-39987 in Marimo notebooks to steal AWS credentials and SSH into a bastion host in eight seconds.

Sysdig Threat Research Team documented an intrusion abusing CVE-2026-39987, an unauthenticated RCE in Marimo's terminal WebSocket endpoint affecting versions up to 0.20.4 and fixed in 0.23.0. The attacker harvested AWS credentials from the host environment and Redis backend, queried AWS Secrets Manager to retrieve an SSH private key, and authenticated to an internet-facing SSH bastion host just eight seconds after opening the WebSocket session. Human-operated custom tooling, not an AI agent, executed the full exploit-to-lateral-movement chain.

Cyber Security News·updated Sep 15, 11:52 UTC · 21h ago·first Sep 15, 09:02 UTC · 1d agoExploit / PoC in the wild 4 sourcesCVE-2026-39987

Machine Unlearning as Private Retroactive Algorithms

A cs.CR paper defines private retroactive algorithms, showing machine unlearning is a data-maintenance problem and giving DP constructions for linear statistics, clustering, histograms.

The paper argues that machine unlearning's requirement to emulate retraining from scratch carries no meaningful privacy semantics against adversaries observing sequences of releases, recasting it as a data-maintenance question addressed by retroactive algorithms. It defines private retroactive algorithms, combining retroactivity with differential privacy under continual observation. Constructions achieve privacy and retroactivity at no asymptotic cost over privacy alone for linear statistics, clustering, and histograms, alongside impossibility results.

arXiv cs.CR·Sep 4, 16:32 UTC · 11d agoResearch

Google’s AI weather model now uses more raw satellite data

Google launched WeatherNext 3, an AI weather model using raw satellite data that beats ECMWF and now powers Search, Gemini, and Maps.

Google released WeatherNext 3, an AI weather forecasting model that incorporates physical surface information (land/ocean type and elevation) to improve surface temperature and dewpoint calculations, improving point location temperature accuracy by up to 30 percent. Its white paper reports roughly 5 percent better upper-atmosphere accuracy than WeatherNext 2, equating to about six additional hours of forecast lead time, outperforming the ECMWF AI model on these metrics. The model now supplies forecast information across Google Search, Gemini, and Maps, though the paper notes unexplained short-lead degraded results and grid-shaped artifacts in some predictions.

Ars Technica · AI·Sep 8, 18:00 UTC · 7d agoModel release

Implementation of Machine Learning Workflows with NVIDIA cuML, RAPIDS, GPU Benchmarking, Explainability, Clustering, and Model Inference

Hands-on tutorial implements NVIDIA cuML and RAPIDS to GPU-accelerate scikit-learn-style ML workflows with benchmarking, clustering, and inference.

The tutorial demonstrates NVIDIA cuML as a GPU-accelerated machine learning framework, using cuml.accel to speed up unmodified scikit-learn scripts with zero code changes and the native cuML API for CuPy/cuDF interoperability. It benchmarks CPU versus GPU implementations of PCA, K-Means, nearest-neighbor search, logistic regression, random forests, and DBSCAN on datasets up to 200,000 samples with 64 features. It also builds GPU pipelines with UMAP, t-SNE, and HDBSCAN, validates GPU-generated SHAP explanations, uses the FIL library for forest inference, and covers model serialization and GPU/CPU portability.

MarkTechPost·Sep 13, 01:42 UTC · 3d agoAI tools & infra

U.S. CISA adds a MLflow flaw to its Known Exploited Vulnerabilities catalog

CISA added actively exploited MLflow SSRF flaw CVE-2026-64849 (CVSS 9.3) to its KEV catalog; attackers are stealing cloud credentials from exposed instances.

CISA added CVE-2026-64849, a critical unauthenticated server-side request forgery in MLflow, to its Known Exploited Vulnerabilities catalog. The flaw affects MLflow versions before 3.15.0 and allows unauthenticated attackers to reach internal services including cloud metadata endpoints, exposing temporary cloud credentials. watchTowr observed in-the-wild exploitation exfiltrating credentials and secrets, plus widespread scanning of exposed MLflow instances within hours of the CVE's assignment on August 17, 2026. MLflow is an open-source platform for managing the machine learning and AI development lifecycle with over 60 million monthly downloads.

Security Affairs·Aug 20, 08:58 UTC · 27d agoExploit / PoC in the wildCVE-2026-64849

Multi-Task Learning for Sparsely-Labeled Time Series: A Case Study on Cold-Hardiness Modeling

Multi-task RNN architectures pooling sparse cultivar data improve grape cold-hardiness and budbreak prediction over single-task and scientific baselines.

Researchers apply recurrent neural networks to daily grape cold-hardiness prediction from weather time series, where per-cultivar labels are temporally sparse and limited. They design multiple multi-task learning architectures that treat cultivars as tasks and evaluate them in both MTL and transfer learning settings. Certain architectures consistently outperform single-task learning and state-of-the-art scientific models, and a single MTL model jointly learning cold hardiness and budbreak improves accuracy on both tasks.

arXiv cs.AI / cs.LG / cs.CL·Sep 8, 17:17 UTC · 7d agoAI research

When the prompt becomes the payload: A practical pen-testing guide for GenAI, LLM and RAG applications

CSO Online publishes a practical penetration-testing guide for GenAI, LLM, and RAG applications, covering prompt injection, retrieval poisoning, and tenant isolation testing.

The guide frames LLM applications as attack graphs spanning prompts, retrieval layers, vector stores, tools, identities, and downstream APIs, arguing that conventional web testing misses instruction-vs-data channel risks. It builds on OWASP prompt injection guidance (direct vs. indirect injection) and NIST's 2025 adversarial machine-learning taxonomy, noting that RAG and fine-tuning do not remove injection risk. Recommended practices include documenting trust transitions across components, using canaries and synthetic records to avoid test side effects, running multi-turn and obfuscated injection campaigns, and verifying chains from poisoned documents to observable state changes. It also details testing RAG pipelines via controlled document poisoning across metadata, OCR layers, and code comments, plus cross-tenant isolation checks on retrieved document IDs.

CSO Online·Sep 9, 10:00 UTC · 6d agoAI safety & security1

Learning with Covariance Matrices: Principal Component Analysis Meets Learning with Graphs

Theoretical tutorial establishes equivalence between covariance neural networks and PCA, with stability and transferability bounds and brain-age applications.

The paper reviews the theory of coVariance neural networks (VNNs), graph neural networks that operate on covariance matrices as graphs. It derives a conceptual equivalence between VNNs and PCA-based information processing, refined stability bounds under finite-sample covariance perturbations, and transferability characterizations across multiscale datasets. Demonstrated applications include brain age gap estimation for neurodegenerative conditions from neuroimaging data.

arXiv cs.AI / cs.LG / cs.CL·Sep 9, 17:28 UTC · 6d agoAI research1

Almost Half of Malware Samples Communicate Direct to IP

Unit 42 analysis of 4 million malware reports finds 45% of C2-active samples connect directly to hard-coded IPs, bypassing DNS defenses.

Palo Alto Unit 42 analyzed over 4 million Advanced WildFire dynamic analysis reports and found that 45.32% of malware samples with C2 activity made at least one direct-to-IP connection, accounting for 23.17% of all C2 connection attempts. The firm proposes zero trust IP (ZT-IP), an enforcement approach that verifies whether outbound destinations were ever sanctioned by a DNS response. ZT-IP analysis surfaced Phorpiex ransomware droppers fetching payloads directly from C2 IPs, a persistent data exfiltration campaign using an obfuscated \GET protocol, and Mozi P2P botnet payloads delivered to IoT devices without DNS. Only 1% of benign samples connected directly to untrusted IP addresses.

Palo Alto Unit 42·Aug 17, 12:45 UTC · 29d agoResearch

Studying Image Tokenizers as Visual Languages in Unified Multimodal Models

A controlled autoregressive testbed shows validation losses must be analyzed per task, and image tokenizer choice affects joint multimodal text modeling.

Researchers built a pure-autoregressive testbed to study image tokenizers as the 'visual language' of unified multimodal models, tracking task-specific validation losses during multimodal continual pretraining across text, image, text-to-image (T2I), and image-to-text (I2T) prediction. They found that losses exhibit distinct scaling behavior per task and rank tokenizers differently, and that I2T loss over a shared text vocabulary gives a more consistent loss–performance signal than T2I loss. Better reconstruction does not necessarily yield lower task-specific losses or stronger downstream performance, and tokenizer choice can affect text modeling under joint optimization. Case studies examine the discriminator, semantic supervision, and vocabulary size design axes.

Hugging Face daily papers·Sep 7, 20:00 UTC · 8d agoAI research1

Emerging Threats to Neurotechnology

Recorded Future·Aug 5, 00:00 UTC · Aug 5, 2026Ransomware

MAxBench: A Multinomial Concept Recovery Benchmark

MAxBench evaluates multinomial concept recovery methods, finding affine subspaces steer most reliably but none consistently beats prompting.

MAxBench is a geometry-agnostic evaluation framework for multinomial concept representations in language models, based on sampling from recovered concept representations. It compares 10 localization methods covering 5 geometry types across 6 concepts and 4 models. Findings show affine subspaces steer more reliably than rank-one or linear subspaces due to better non-zero offsets, manifold steering is competitive where applicable, and no method consistently outperforms prompting.

arXiv cs.AI / cs.LG / cs.CL·Sep 11, 17:08 UTC · 4d agoAI research

DeepSeek, Alibaba and Chinese AI Firms Extract Billions of Tokens From U.S. AI Models

NSA, CISA and FBI advisory AA26-251A accuses DeepSeek, Alibaba and four other Chinese AI firms of industrial-scale distillation of US frontier models.

Joint advisory AA26-251A from NSA, CISA and FBI accuses DeepSeek, Alibaba, Moonshot AI, MiniMax, StepFun and Z.AI of extracting billions of tokens from Claude, GPT, Gemini and Grok variants since at least late 2024, likely with Chinese government awareness. Campaigns allegedly used API proxy 'transfer stations', account pools, metadata sanitization and prompt injection to harvest reasoning, coding, agentic and reinforcement-learning capabilities, with techniques mapped to MITRE ATLAS. DeepSeek's R1 and V3 and Alibaba's Qwen families reportedly trained on harvested outputs, and DeepSeek's $5.6 million training-cost claim is disputed as excluding distilled data value. Agencies urge anomaly monitoring, output alteration for suspected extractors, and intelligence sharing across vendors, clouds and aggregators.

GBHackers·Sep 9, 08:29 UTC · 7d agoAI safety & security in the wild1· 1 read

Graph Machine: Towards Better Pretraining via Edges

Researchers propose Graph Machine, an O(n)-state sparse architecture that replaces 75% of Qwen3-0.6B dense layers with only slight loss change.

The paper introduces the Graph Machine (GM), an architecture that maintains an O(n)-sized state accessed through sparse, dynamic routing via pointer-like edges updated differentiably by a referral mechanism resembling pointer chasing. The authors replaced 75% of dense Transformer layers in Qwen3-0.6B with GM sparse layers and pretrained from scratch on 15.7B tokens. Retrieving 2 of 4,096 tokens per KV head in each sparse layer degrades loss only slightly, while retrieving 4 marginally improves loss over the dense baseline.

Hugging Face daily papers·Sep 1, 20:00 UTC · 14d agoAI research

Attackers Expose Ongoing AI Tool Use Targeting Organizations in Latin America

Unit 42 documents two AI-assisted intrusion campaigns against Latin American government, utility, and financial organizations using LLM-orchestrated tooling.

Palo Alto Networks Unit 42 tracks two ongoing intrusion clusters, CL-CRI-1131 (Mexican transportation, federal ministries, municipal water utilities) and CL-CRI-1163 (Brazilian financial sector), both using living-off-the-land techniques, SOCKS5 relays, and custom RATs. The attackers appear to orchestrate operations via commercial LLMs like Claude and GPT-4.1, evidenced by iterative batch scripts and AI-generated tunneling tool naming. The Mexican campaign (also reported as Operation Escaneo by CloudSEK) exfiltrated sensitive data via dynamic-DNS infrastructure with rotated multi-SAN TLS certificates between February and June 2026. This signals broader adoption of AI-enhanced operations by diverse threat groups in the region.

Palo Alto Unit 42·Sep 3, 10:00 UTC · 12d agoThreat actor in the wild1

Understanding the Impact of Model Pruning on Long-Tail Forgetting and Explanation Reliability in Medical Imaging

Systematic study finds model pruning causes frequency-dependent long-tail forgetting in medical imaging and that gradient-informed methods best preserve explanations.

Across two long-tailed medical imaging datasets, two CNN architectures, four pruning methods, and sparsity up to 95%, the study measures predictive performance, explanation stability, and faithfulness. Rare classes degrade earlier and more severely than frequent ones, while explanation reliability depends mainly on the pruning strategy, with gradient-informed methods degrading least. Mechanistic analysis ties explanation collapse to loss of class-discriminative gradients rather than vanishing feature activations, recommending class- and explanation-aware evaluation of compression.

arXiv cs.AI / cs.LG / cs.CL·Sep 7, 17:44 UTC · 8d agoAI research

Distill Globally, Adapt Locally: Reasoning Distillation and Product-Type Test-Time Training for Scalable Trade-Up Recommendation

A distillation framework compresses LLM reasoning into a 15.5M-parameter trade-up recommendation model reaching AUC 0.941 with product-type test-time training.

The paper targets trade-up recommendation, which identifies higher-quality alternatives that preserve customer purchase intent. A retrieval-augmented few-shot LLM teacher generates labels and rationales that supervise a compact embedding-pair classifier; at inference the 15.5M-parameter student uses only two precomputed 768-dimensional embeddings with no LLM calls. On 8,352 annotated pairs, label-only training scored AUC 0.912, reasoning distillation reached 0.924, and product-type test-time training lifted it to 0.941 with average precision 0.940. The distilled student is roughly 5,000x faster and 10,000x cheaper than direct LLM inference on a 100K-pair proxy catalog.

arXiv cs.AI / cs.LG / cs.CL·Sep 4, 17:08 UTC · 11d agoAI research

Scaling Automatic Research Agents via World Models

WMRL replaces environment execution with a world model in RL, accelerating research-agent post-training 3-4x and letting 4B/9B agents beat 48B/120B open-weight agents.

The paper identifies that environment execution dominates RL training cost for automatic research agents because each execution occupies an exclusive sandbox while generation batches efficiently. World Model RL (WMRL) substitutes a learned world model for execution, with Online Debiasing and Inverse-Variance Denoising to handle reward bias and noise, and the paper proves both improve convergence guarantees. WMRL accelerates training 3-4x across tasks and outperforms standard RL baselines; post-trained 4B and 9B agents beat 48B and 120B open-weight agents on held-out benchmarks. WMRL also transfers to post-training embodied VLA policies.

Hugging Face daily papers·Aug 28, 20:00 UTC · 18d agoAI research1

General Quantification of Covariate and Concept Shifts

Paper proposes γ*-concept shifts via entropic optimal transport, deriving estimable generalization bounds unifying covariate and concept shift under distribution shift.

The authors show existing definitions of concept shift break when source and target supports mismatch and propose γ*-concept shifts grounded in entropic optimal transport. They derive a general error bound covering broad loss functions, label spaces and stochastic labeling, plus estimators with concentration guarantees. The resulting DataShifts algorithm quantifies distribution shifts and estimates the error bound in most applications, addressing learning bounds that were previously non-estimable from samples.

arXiv cs.AI / cs.LG / cs.CL·Sep 10, 17:57 UTC · 5d agoAI research1

Studying Image Tokenizers as Visual Languages in Unified Multimodal Models

A controlled pure-autoregressive testbed shows task-specific validation losses rank image tokenizers differently, with I2T loss the most consistent signal.

Researchers built a controlled pure-autoregressive testbed and tracked task-specific validation losses during multimodal continual pretraining across text, image, text-to-image (T2I), and image-to-text (I2T) prediction. They find losses should be analyzed per task because they exhibit distinct scaling behavior and rank tokenizers differently, and that the loss-performance relationship depends on the predicted token space. I2T loss, computed over a shared text vocabulary, correlates consistently with both generation and visual understanding performance after supervised finetuning. Case studies revisit the discriminator, semantic supervision, and vocabulary size as tokenizer design axes.

arXiv cs.AI / cs.LG / cs.CL·Sep 8, 17:57 UTC · 7d agoAI research1

Sakana AI Researchers Introduce PC-ALM, a Layer-Local Alternative to Backpropagation That Trains 1000-Layer Networks

Sakana AI's PC-ALM adds per-layer Lagrange multipliers to predictive coding, matching backprop on networks up to 1000 layers with layer-local updates.

Sakana AI researchers propose Augmented Lagrangian Predictive Coding (PC-ALM), a training method that keeps every update layer-local while recovering backprop-aligned credit signals. The team proves multipliers converge to exact backprop adjoints in linear networks and trains 1000-layer residual MLPs on MNIST within about 2 points of backprop accuracy. PC-ALM matched backprop across a width/depth grid from 8 to 128 on MNIST and Fashion-MNIST where standard predictive coding failed in deep, narrow networks, and improved over PC on ResNet-18 with CIFAR-10 and Tiny ImageNet. An MIT-licensed JAX reference implementation reproduces the results on CPU.

MarkTechPost·Sep 14, 20:46 UTC · 1d agoAI research1

From Concept to Context Engine: How Wiz Built AI-Powered Data Discovery

Wiz details the multi-agent pipeline and feedback loops that evolved its bucket scanner into AI-powered data discovery.

Wiz published an engineering write-up on building its AI-powered data discovery capability, tracing the evolution from a bucket scanner to a context engine. The post explains the multi-agent pipeline and feedback loops behind the system. The article is a vendor engineering deep-dive with no disclosed vulnerabilities, incidents, or exploitation activity.

Wiz Blog·Aug 27, 15:52 UTC · 19d agoTools1

AI models flub these intelligence tests. Can you fare any better?

MIT Technology Review examines puzzle and game benchmarks where current AI models still underperform, probing the limits of machine intelligence tests.

MIT Technology Review explores puzzles and games as benchmarks for gauging AI progress, tracing the practice back to the origins of machine learning in a 1959 article by IBM's Arthur Samuel. The piece highlights intelligence-style tests that today's models still fail and questions what those results reveal about model capabilities. It situates gaming benchmarks within the broader debate over measuring machine intelligence.

MIT Technology Review · AI·Aug 26, 09:00 UTC · 21d agoAI research

NOAH: Learning the Full Patient Journey. A Longitudinal Multimodal Time-Aware Model for Representation and Forecasting

Researchers introduce NOAH, a time-aware generative transformer trained on 559 million MIMIC clinical events to forecast multimodal patient trajectories.

NOAH is a task-agnostic, time-aware generative transformer trained on over 559 million clinical events from 431,000 hospital visits by 299,000 patients across the MIMIC dataset family. It uses bidirectional time integration and a variational latent space to model the stochastic evolution of patient states, natively processing medical images, time-series signals, categorical events, and structured or unstructured clinical records. The model supports autoregressive forecasting with optional time control, zero-shot classification, and counterfactual intervention simulation, with strong probing performance across clinical outcomes, 15 ICD chapters, and 29 comorbidities.

Hugging Face daily papers·Sep 7, 20:00 UTC · 8d agoAI research1

Coupled Calibration and Learning: Mitigating Teacher Bias in LLM Distillation without Target-Domain Reward Feedback

CCL couples teacher calibration with student updates via token-level branching, provably removing teacher bias in LLM distillation.

The paper proposes Coupled Calibration and Learning (CCL), an LLM distillation algorithm that alternates teacher calibration using source-question reward feedback with student training on target questions under covariate shift. Each iteration calibrates the teacher on source feedback, trains the student on target questions, and lets the updated student inform subsequent calibration. The authors prove the student's expected KL divergence to the oracle student converges to zero at a polynomial rate, and show regularized direct matching error can remain bounded away from zero.

arXiv cs.AI / cs.LG / cs.CL·Sep 15, 17:15 UTC · 16h agoAI research

Transfer Learning for Evolving Domains

TrED formalizes transfer learning for domains whose data availability evolves over time, arguing classical settings are regimes along one trajectory, and remains unsolved.

The paper introduces Transfer Learning for Evolving Domains (TrED), formalizing transfer learning as a trajectory problem where target data and labels are progressively collected. TrED is specified by a data availability process fixed by the environment, a freely chosen learning protocol, and an evaluation criterion scoring the whole trajectory of models. Classical settings like domain generalization, domain adaptation, and multi-domain learning are recovered as regimes within this framework. The authors survey the literature and find most methods are tailored to a single regime, leaving TrED a well-posed open problem.

arXiv cs.AI / cs.LG / cs.CL·Sep 11, 16:37 UTC · 4d agoAI research

Local gradient neural operator

Researchers propose LGNO, a lightweight interpretable neural operator using learnable local stencils, matching global-operator accuracy on PDE benchmarks with fewer parameters.

LGNO builds on nonlinear gradient discretization priors and uses multilayer perceptron convolutional layers to learn translation-invariant local kernels resembling discrete stencils. A zero consistent stencil factorization separates coefficient learning from field reconstruction, and network folding shares equivalent components to cut parameter counts for symmetric problems. Evaluations on linear and nonlinear, static and dynamic, and low- and high-dimensional PDE benchmarks show maintained accuracy, parameter efficiency, and rollout stability, with applicability to diffusion, flow, and quantum problems.

arXiv cs.AI / cs.LG / cs.CL·Sep 7, 16:53 UTC · 8d agoAI research

NOAH: Learning the Full Patient Journey. A Longitudinal Multimodal Time-Aware Model for Representation and Forecasting

Researchers introduce NOAH, a generative time-aware transformer trained on 559 million MIMIC clinical events to model and forecast patient trajectories.

NOAH is a task-agnostic, time-aware generative transformer designed to represent and forecast the full multimodal patient journey across medical images, time-series signals, categorical events, and clinical text. It was trained on over 559 million clinical events from 431,000 hospital visits covering 299,000 patients in the MIMIC dataset family. The architecture combines bidirectional time integration with a variational latent space to capture continuous patient state evolution and clinical stochasticity. NOAH supports autoregressive forecasting with time control, zero-shot classification, and counterfactual intervention simulation, with evaluations on 15 ICD chapters, 29 comorbidities, and time-to-event prediction.

arXiv cs.AI / cs.LG / cs.CL·Sep 8, 17:56 UTC · 7d agoAI research2

Beyond Solver Verdicts: Generative Reward Models for Autoformalization

Researchers introduce Generative Verification (GenV), a generative reward model achieving 0.961 AUROC in detecting unfaithful autoformalization that preserves solver verdicts.

The paper formalizes Verdict-Preserving-Unfaithfulness (VPU), a failure mode in neurosymbolic autoformalization where an incorrect encoding executes successfully and matches the expected solver verdict, and proves verdict-only verification is bounded to chance-level detection. The proposed Generative Verification (GenV) distills an offline Z3-equivalence oracle into a reference-free, continuous reference-equivalence score within the language model's vocabulary space. The oracle-mined verifier (GenV+HN) achieves 0.961 AUROC, generalizes zero-shot across unseen translators and formal styles, and yields an 11.3-point downstream accuracy gain in agentic test-time compute allocation. Mechanistic analysis with decision-projected logit lenses and sparse autoencoders shows the generative readout extracts precise spatial error coordinates without explicit localization training.

Hugging Face daily papers·Sep 9, 20:00 UTC · 6d agoAI research1

I wrote an AI textbook — how long until AI can do it better?

AI researcher Nathan Lambert argues LLMs remain weak at long-form technical writing, questioning whether models can autonomously organize scientific knowledge for breakthroughs.

Nathan Lambert describes writing a post-training textbook, Reinforcement Learning from Human Feedback, and finds today's LLMs weak at organizing long-form technical content despite becoming superhuman at coding and math. He notes GPT 5.5 Pro found deep typos across a 200-300 page manuscript while Claude models proved more useful as editors. He argues that compressing knowledge through writing is a prerequisite for autonomous scientific insight and tempers expectations for near-term AI-driven open science.

Interconnects·Aug 12, 13:01 UTC · Aug 12, 2026AI research

Meta FAIR Introduces AI Research Preference Models (RPMs): Ranking ML Experiments Before Spending GPU Hours

Meta FAIR, Oxford and UCL introduce Research Preference Models that rank unexecuted ML experiments, lifting AIRS-Bench scores from 0.684 to 0.729 and cutting compute ~1.6×.

Researchers from Meta FAIR, Oxford, and UCL introduce Research Preference Models (RPMs), which use frozen pretrained LLMs (Qwen3.6-27B backbone, no fine-tuning) to rank unexecuted experiment candidates and execute only the winner of a pairwise knockout tournament. Two variants shipped: an inference-only LLM-as-a-judge and an agentic variant that runs small pilot experiments in an H200 sandbox. On AIRS-Bench (20 tasks, 24 hours on one H200, 10 seeds), scores rise from 0.684 (random) to 0.711 and 0.729 versus a 0.748 validation oracle, and both variants reach the baseline's 24-hour score in roughly 15 hours. The team reports new SOTA on WinoGrande (94.1% with Agentic RPM) and SVAMP (95.7% with inference-only).

MarkTechPost·Sep 6, 20:25 UTC · 9d agoAI research

Windows Malware Detector as a Compound AI System: Trade-Offs in Accuracy, Efficiency, and Adversarial Robustness

Researchers model industrial Windows malware detection as a Compound AI System, quantifying trade-offs between detection accuracy, efficiency, and adversarial robustness under tiered attacker knowledge.

Industrial Windows malware detectors combine rule-based mechanisms with ML-based static and dynamic analyses, but their architectures are rarely publicly disclosed. The authors propose a methodology balancing detection performance, computational cost, and robustness, plus system-level threat models capturing whole-pipeline evasion rather than isolated components. Experiments on real-world data show training time reductions with marginal detection loss, while more knowledgeable attackers craft increasingly effective adversarial examples. The paper derives deployment guidelines from the observed efficiency-robustness trade-off.

arXiv cs.CR·Sep 8, 08:04 UTC · 8d agoResearch

Training and Finetuning Multi-Vector Embedding Models with Sentence Transformers

Hugging Face published a tutorial on training and finetuning multi-vector embedding models using the Sentence Transformers library.

Hugging Face's blog walks through training and finetuning multi-vector embedding models with Sentence Transformers. Multi-vector approaches store multiple vectors per document to support late-interaction retrieval. The post is a practical guide for developers building retrieval pipelines with the library.

Hugging Face Blog·Aug 26, 00:00 UTC · 21d agoAI tools & infra1