Search: “dimension”

Multi-Dimensional Prosody Judgment For Live Streaming Speech Synthesis

Researchers introduce Live-ProsodyJudge and D-LPJ, Gemini-distilled Qwen3-Omni judges that decouple multi-dimensional prosody scores for live streaming TTS evaluation.

Researchers introduce Live-ProsodyJudge (LPJ), a pairwise TTS prosody evaluator distilled from Gemini into Qwen3-Omni for cost-effective live streaming speech synthesis evaluation. They identify verdict coupling, where multi-dimensional judges collapse dimension scores into a single preference bit, and propose Decoupled-Live-ProsodyJudge (D-LPJ) using masked SFT and a span-local GRPO strategy. Balanced-order LPJ beats a single Gemini call in point accuracy, and in a Best-of-8 TTS selection tournament the chosen utterance falls in the human top-3 for 85.29% of high-confidence cases.

arXiv cs.AI / cs.LG / cs.CL·Sep 17, 12:20 UTC · 1d agoAI research

Architectures, Risks, and Adoption: How to Assess and Choose the Right AI

The Hacker News·Oct 15, 00:00 UTC · Oct 15, 2025AI research

LLM Classification Is Feature Engineering

Argues LLM classifiers should feed a downstream logistic regression, yielding calibration, threshold control, and principled use of structured covariates.

The post contends that LLM-as-classifier setups suffer from poorly calibrated hard labels, opaque use of prompt context and structured data, and weak interpretability. Wrapping the LLM verdict as a feature in a logistic regression restores calibrated probabilities, precision–recall threshold control, and the ability to incorporate additional covariates. Further gains can come from more training data, richer features such as log probabilities and subverdicts, and swapping in downstream models like xgboost or neural networks. An irony detection test case illustrates the approach.

Hacker News · AI·Sep 17, 15:40 UTC · 22h agoAI researchHN 45↑ · 10 comments

Minimax-Optimal Online Contract Design with Unrestricted Bounded Contracts

The paper proves minimax-optimal regret of order T^(m/(m+1)) for repeated online contract design with unrestricted bounded contracts and arbitrary agent action spaces.

The study analyzes repeated contract design where a principal observes outcomes but not agent actions, allowing arbitrary bounded outcome-contingent payment vectors. For any fixed number m of outcomes with m>=2, minimax regret over T rounds is of order T^(m/(m+1)) up to logarithmic factors, matched by upper and lower bounds. The upper bound uses an effective-dimension reduction and revealed preference in payment-difference coordinates, without smoothness or monotone-surplus assumptions, while the lower bound shows each additional contractible outcome increases worst-case learning cost.

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

Retrospectively Reverse-Engineering Apple's Neural Engine

A developer reverse-engineers Apple's M1 Neural Engine architecture, mapping compute cores, MAC datapaths, and schedulers to explain the NPU's decline as transformers displaced CNN workloads.

A developer who previously maintained a reverse-engineered Linux driver for Apple's Neural Engine (ANE) published a retrospective deep dive mapping the M1 ANE's full internal architecture: compute, datapath, scheduler, memory, and execution model. The M1 ANE has 16 compute cores with 128 FP16 (or 256 INT8) MAC lanes each, totaling 2048 parallel MAC lanes, using 32-bit Q16.16 fixed-point accumulation with FP16 readout and an accumulator that saturates at 2^15. The author argues the ANE's dataflow was architected around the predictable reuse patterns of 2017-era CNN workloads (dating to the A11 Bionic), which autoregressive transformer decode broke, limiting its usefulness for general ML. With Apple's M5 folding ANE cores into GPU cores to tout LLM performance, the post frames this as the beginning of the end for the standalone NPU.

Hacker News · AI·Sep 12, 07:54 UTC · 6d agoAI researchHN 54↑ · 7 comments2

Likelihood-free inference with nuisance parameters through normalizing flows

Researchers decompose normalizing flows to derive near-pivotal statistics for likelihood-free inference with nuisance parameters, recovering the t-test and beating Welch limits.

A new paper decomposes neural-network normalizing flows to uncover pivotal statistics in the presence of nuisance parameters using only a sample generator from the distribution of interest. The statistic is near-pivotal in the sense of minimum average KL-divergence of its p-values and can incorporate prior knowledge of group invariances such as translation and scale. Experiments show it recovers the one-sample t-test almost exactly, outperforms the Welch test on worst-case size over a constrained variance-ratio range, and delivers higher power and much faster runtime than profile likelihood-ratio techniques on small-to-moderate samples.

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

Nearly Tight Rademacher Bounds for Sparsely Activated Neural Networks

Theory paper derives nearly tight Rademacher complexity bounds for sparsely activated one-hidden-layer ReLU networks.

Building on Awasthi et al. (COLT 2024), the authors bound statistical complexity for networks where each input activates at most k of s hidden units. A support-preserving cover and normalized chaining argument remove the explicit dimension factor, with matching lower bounds up to logarithms. They also derive agnostic minimax excess-risk bounds of order min{1, sqrt(s/(km))} for a normalized bounded loss and show bias bounds comparable to WR restore worst-case rates even on domains where sparsity holds globally.

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

Detecting Deceptive Recruitment: A Signal-theoretic Machine Learning Framework for Early Identification of Labour Exploitation

Researchers build a multimodal ML framework detecting deceptive job advertisements used for labour exploitation, achieving ROC-AUC 0.87–0.97 across individual modalities.

Using 464 verified cases (164 deceptive, 300 legitimate) gathered through anti-slavery charities across nine origin countries and 21 industries, researchers combined computer vision, NLP, and semantic embeddings to flag exploitative recruitment ads. SHAP analysis identified text quality, readability indices, risk keyword density, and visa sponsorship mentions as top discriminators, with combined modalities reaching ROC-AUC up to 0.97. Findings are operationalized in a proof-of-concept decision support system providing interpretable risk scores for practitioners.

arXiv cs.AI / cs.LG / cs.CL·Sep 17, 13:06 UTC · 1d agoAI research

Sharp Reconstruction Bounds for Autoencoders Using the Same Forward Map

Theoretical work derives sharp reconstruction-derivative error bounds for autoencoders using the same forward map, validated on a 798,452-point LiDAR forest scan.

For equal odd input and hidden dimensions d≥3, the paper proves the least uniform reconstruction-derivative error among orientation-preserving diffeomorphisms with Jacobian singular values in [m,M] equals max{1−M(M−m)/2,0}, attained by affine maps. A translated radial rotation can nonetheless reconstruct any prescribed ball exactly with singular values near one, motivating additional conditions for finite-data bounds. On a 798,452-point terrestrial LiDAR forest scan, the theoretical bound at input scale 0.05 was 0.155, about 84% of the mean normalized training error of 0.185.

arXiv cs.AI / cs.LG / cs.CL·Sep 17, 13:04 UTC · 1d agoAI research

Google Research Introduces Retrieve-for-Train (R4T): An RL-Compiled Diffusion Retriever for 12× to 20× Faster Query Fan-Out

Google Research introduced R4T, an RL-trained fan-out pipeline distilled into a 53.9M-parameter diffusion retriever achieving 12x-20x faster query fan-out.

Google Research introduced Retrieve-for-Train (R4T), which trains a fan-out language model with GRPO plus soft PPO regularization, then distills query fan-out into a 53.9M-parameter diffusion transformer that generates all retrieval embeddings in a single non-autoregressive pass. A three-term reward (groundedness 0.6, diversity 0.2 via Vendi Score, alignment 0.2) prevents paraphrastic collapse and reward hacking during training. On the Polyvore dataset, Gemma3-4B R4T-FOLM averaged 49.1 versus 40.9 for Best-of-N, and the diffusion retriever cut fan-out latency from 1.46s to 0.07s at batch size 8, a consistent 12x-20x speedup over autoregressive methods.

MarkTechPost·Sep 17, 06:19 UTC · 1d agoAI research1

MUSE: Benchmarking Large Vision-Language Models on Multi-Modal Understanding in Situated Education

Introduces MUSE, a twelve-task benchmark evaluating vision-language models on artistic image understanding in situated educational, Southeast Asian contexts.

MUSE is a benchmark assessing large vision-language models on artistic image understanding across twelve tasks spanning visual perception, semantic and affective interpretation, cultural understanding, and compositional reasoning. It decouples image annotation from question generation for controllable difficulty and curates images centering Singaporean and Southeast Asian multicultural contexts alongside Western art. Evaluations of open-source and proprietary models found substantial disparities, especially in affective interpretation and compositional reasoning.

arXiv cs.AI / cs.LG / cs.CL·Sep 16, 17:26 UTC · 1d agoAI research1

A General Kernel Framework for Non-CND Distance Measures Using |D|-Dimensional Sparse Landmark Embeddings

Proposes the Sparse Landmark Embedding kernel, guaranteeing PSD kernels for arbitrary distances like geodesic and Wasserstein without CND requirements.

The paper introduces the Sparse Landmark Embedding (SLE) kernel, which embeds inputs via compactly supported bump functions at all |D| training points so any standard PSD kernel applies, removing the Hilbertian (CND) distance requirement that fails on manifolds and distribution spaces. Compact support controls sparsity, keeping kernel matrices well-conditioned despite high dimensionality. The authors prove PSD, sparsity, stability, and universal approximation guarantees, and show SLE matches or exceeds domain-specific baselines using geodesic and Wasserstein distances on accuracy and uncertainty quantification.

arXiv cs.AI / cs.LG / cs.CL·Sep 16, 17:23 UTC · 1d agoAI research

Agora: Git as Shared Memory for Collective AutoResearch

Agora records multi-agent research as an append-only Git DAG; 13 LLM workers ran nearly 12 days on a weight-transfer problem.

Agora stores every result, hypothesis, and verification as an immutable commit in a Git-stored DAG, with a derived index exposing the frontier and verification status of claims. In a nearly 12-day run, 13 language-model workers with no assigned tasks or central planner published 1,703 contributions on initializing a frozen 119.6M-parameter attention-SSM hybrid from 141 donor models. They improved the evaluator from 3.39 to 1.899 bits per byte, closing 62% of the gap to a trained GPT-2 124M, with 165 independent reproductions posted and none failing.

Hugging Face daily papers·Sep 15, 20:00 UTC · 2d agoAI research

Can MiniMax-H3 Reason About the Physical World? An Evaluation of Omni-Modal Generative Model

Researchers benchmark MiniMax-H3 omni-modal generation on physical world reasoning across 517 multimodal tasks, finding 41.97% overall success and weak audio-based disambiguation.

The paper introduces an evaluation framework for physical world reasoning in Omni-Modal Generative Models, applied to MiniMax-H3, which combines multimodal understanding with joint audio-visual generation. Tasks span four scenarios: implicit prompts paired with multiple frames, audio-image, prefix-videos, and audio-video inputs, with each modality providing only partial evidence. Across 517 evaluation instances, MiniMax-H3 achieves a 41.97% overall success rate, peaking at 56.00% on video-based decision reasoning and dropping to 27.40% on audio-based disambiguation. The project is available on GitHub.

Hugging Face daily papers·Sep 15, 20:00 UTC · 2d agoAI research

What Breaks Under Pruning in Smart Homes, and When? Evaluating LLM Degradation Across Architectures and Task Complexity

Pruning study across four LLM architectures finds dense models degrade sharply on smart-home tool calling while MoE models tolerate far more.

Researchers systematically study pruning-induced degradation in smart-home tool calling across four LLMs spanning dense Transformer, dense hybrid, and mixture-of-experts architectures, combining depth, width, hybrid, and expert pruning methods, and evaluate over 19,500 instances from three datasets after post-pruning supervised fine-tuning. Dense models show narrow safe pruning regions followed by sharp degradation, while MoE models tolerate substantially more pruning. Pruning degrades grounded specificity (operation, device, argument, value) before schema-level intent, and aggressive dense pruning can induce systematic over-refusal.

arXiv cs.AI / cs.LG / cs.CL·Sep 15, 17:51 UTC · 2d agoAI research

FreqSpaNet: Frequency and Spatial Learning of SFPF for Physical Layer Hardware Integrity Detection

FreqSpaNet learns spatio-frequency polarization fingerprints to detect unauthorized wireless hardware replacement, reaching 96.31% mean AUROC across seven replacement scenarios.

FreqSpaNet is a representation learning network for open-set hardware anomaly detection using spatio-frequency polarization fingerprints (SFPFs), which capture device-dependent responses across frequencies and directions. A frequency branch models local variations among neighboring frequencies while a geometry-aware spatial branch models directional relationships via angular information, combined through adaptive fusion and complementary pretraining. It achieves a mean AUROC of 96.31%, 9.05 points above the baseline, and is verified under seven hardware replacement scenarios.

arXiv cs.AI / cs.LG / cs.CL·Sep 15, 17:32 UTC · 2d agoAI research1

Quenched Ensemble Sampling

Quenched Ensemble Sampling generalizes nested sampling's hard energy constraint to repulsive potentials, traversing first-order phase transitions where tempering fails.

Quenched Ensemble Sampling generalizes nested sampling's hard energy constraint into a family of repulsive potentials at the energy boundary, preserving monotone energy descent while making the constrained target amenable to scalable gradient-based kernels. On synthetic phase-transition models it estimates marginal likelihood and draws posterior samples across first-order transitions where popular alternatives such as tempering fail. Applications include marginal likelihood estimation for Bayesian neural network architecture comparison and partition function estimation in a high-dimensional continuous lattice field theory.

arXiv cs.AI / cs.LG / cs.CL·Sep 14, 17:16 UTC · 3d agoAI research1

StepAudio 3 Realtime Technical Report

StepAudio 3 Realtime debuts an audio-language model with Think-While-Speaking reasoning, delivering full-duplex voice dialogue with top benchmark results.

StepAudio 3 Realtime is an audio-language foundation model built around a continuous listen-converse-think-act loop for real-time spoken interaction. Think-While-Speaking runs private reasoning in parallel with speech, reaching a 73.0 macro average on StepAudioChat in reasoning mode. The model reports 90.6 on MMSU, 98.9 overall on the Artificial Analysis Full-Duplex Bench, and 56.0% macro task success on tau-Voice. An integrated Voice Agent handles asynchronous tool execution without disrupting dialogue flow.

Hugging Face daily papers·Sep 11, 20:00 UTC · 6d agoAI research

MP-Bench: Evaluating Voice Agents as a Multiparty Conversation Participant

MP-Bench is the first benchmark for voice agents in multiparty conversations, finding real-time agents near chance on turn-taking.

MP-Bench is the first benchmark designed to objectively evaluate conversational speech systems as active participants in multi-party conversations. It assesses agents on turn-taking awareness and response appropriateness, with comprehension-based question-answering as a complementary evaluation. Benchmarking 12 voice agents shows real-time agents score at or below 22% on multiparty comprehension and remain near chance on multiparty turn-taking.

arXiv cs.AI / cs.LG / cs.CL·Sep 11, 17:11 UTC · 6d agoAI research2

MCRL2: Multi-resource Cross-attention-based Representation Learning-augmented Reinforcement Learning for Cloud Microservice Scheduling

MCRL2 augments reinforcement learning with multi-resource cross-attention representations to improve cloud microservice scheduling and load balancing.

MCRL2 combines a multi-resource cross-attention representation learning module (MCRL) with an actor-critic architecture and maximum entropy objective for microservice scheduling. The approach captures interdependencies among nodes, resources, and microservices in data centers. Experiments on real production cluster traces show improvements in load balancing, scheduling success rate, and average completion time versus baselines.

arXiv cs.AI / cs.LG / cs.CL·Sep 11, 16:44 UTC · 6d agoAI research1

Label-Guided Knowledge Distillation for 3D-CNNs in Action Recognition

LGKD uses ground-truth labels to guide feature distillation for 3D-CNNs, combining sample-wise and class-wise distillation for action recognition.

The paper proposes Label-Guided Knowledge Distillation (LGKD) for 3D-CNNs, noting that most video feature distillation methods are simple adaptations of image techniques that neglect temporal-dimension differences. LGKD combines sample-wise distillation, which uses label information and the teacher's probability distribution to guide features impacting temporal accuracy, with class-wise distillation employing a prototype network to capture relational knowledge among same-category samples. Experiments on the UCF101 and HMDB51 action recognition benchmarks achieve competitive results.

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

SNAP3D: Physically Grounded 3D Parts for Assembly from a Single Image

SNAP3D uses physics simulation feedback to make single-image 3D part generation produce valid, stable assemblies, validated through 3D printing.

The framework improves part-aware 3D generation by resolving inter-part penetration, recovering contact graphs between neighboring parts, and placing parameterized connectors at contact surfaces. Physical simulation feedback refines connector placement, orientation, and dimensions to improve assembly stability while preserving geometry. A physics-based evaluation protocol tests assembly validity and stability under gravity, and results are validated through 3D printing and real-world assembly.

Hugging Face daily papers·Sep 10, 20:00 UTC · 7d agoAI research

Generative Late-Interaction Embeddings For Visual Document Retrieval

GLIE compresses visual document retrieval embeddings to four vectors per page while retaining nearly 80% of uncompressed nDCG@5 accuracy.

Researchers analyzing late-interaction retrieval embeddings found they lie exactly on the unit sphere and concentrate near a manifold of intrinsic dimension five to six. GLIE learns a few k vectors per page that serve as a lightweight index and a basis to regenerate the full embedding set for exact rescoring of top candidates at query time. On ViDoRe v1 with four vectors per page, GLIE retains nearly 80% of uncompressed nDCG@5 versus 70% for the best prior post-hoc method, using a 415K-parameter network trained in under three GPU-minutes on 1,000 pages.

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

When Does Scale-Invariant Optimization Become Unstable? An Exact Schedule Law with Weight Decay

Researchers derive an exact law linking learning-rate schedules and weight decay in normalized networks, pinpointing when scale-invariant optimization destabilizes.

The paper shows that normalization makes large parts of neural networks scale-invariant, creating a hidden feedback loop where learning-rate schedules and weight decay interact through the parameter norm to control the effective optimizer step. An exact discrete-time law with a single scalar quantity separates contraction- and expansion-dominated effective learning-rate regimes, and the balance point is intrinsically unstable, so constant learning rate with weight decay produces recurrent behavior instead of a stable equilibrium. A unified homogeneous-optimizer framework explains why adaptive methods stabilize more weakly under normalization. The law is validated with high precision on MLPs, CNNs, and GPT-2 across MNIST, CIFAR, WikiText, and OpenWebText, with code released on GitHub.

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

SAEScientist-Bench: Can AI Agents Conduct Autonomous SAE Interpretability Research?

SAEScientist-Bench tests whether AI agents can autonomously run SAE interpretability research on Gemma-2-9B-IT; frontier agents trail expert baselines.

The benchmark requires agents to design contrastive probes and navigate the Gemma Scope dictionary of over 131K features in Gemma-2-9B-IT to discover optimal interpretable features, scored against expert-curated references on Neuronpedia via activation rank, concept selectivity, and causal steering. Across 10 agent configurations and 20 tasks, frontier agents demonstrate genuine discovery capability and approach expert levels at separating target concepts from controls, but lag substantially in causal steering and frequently misinterpret experimental measurements. The authors frame this as establishing experimental model understanding as a measurable capability for closed-loop autonomous AI R&D and post-hoc monitoring for recursive self-improvement.

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

SAEScientist-Bench: Can AI Agents Conduct Autonomous SAE Interpretability Research?

SAEScientist-Bench evaluates whether AI agents can autonomously conduct SAE interpretability research in Gemma-2-9B-IT, finding frontier agents trail expert baselines.

SAEScientist-Bench tests if AI agents can act as scientists using SAE tools for autonomous mechanistic discovery, requiring them to design contrastive probes and navigate a Gemma Scope dictionary of 131K+ features in Gemma-2-9B-IT. Across 10 agent configurations and 20 tasks, frontier agents showed genuine discovery capability but remained well behind expert reference features, lagging most in causal steering. Agents frequently misinterpreted experimental measurements even when designing effective contrasts.

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

The Price of Sparsity: Sufficient Conditions for Sparse Recovery using Sparse and Sparsified Measurements

Researchers derive sufficient sample-size conditions for recovering sparse binary signals from sparse Gaussian measurements, quantifying an information-theoretic threshold of order slog(p/s)/log(ds/p).

The paper studies support recovery of sparse binary signals from noisy linear measurements. For sparse Gaussian designs, the authors identify sufficient minimal sample sizes for maximum-likelihood recovery in the high-SNR regime d*s/p -> infinity, yielding an information-theoretic threshold of order slog(p/s)/log(ds/p) that makes the price of measurement sparsity explicit. They also show a regime where the sample-complexity loss from sparsity is only logarithmic while computational gains are nearly linear, and prove that for independently sparsified dense Gaussian designs a sample size of order p/ψ² suffices for support recovery at any fixed error level.

Hugging Face daily papers·Sep 7, 20:00 UTC · 10d agoAI research

SAFIRE: Safety-Critical Benchmark for Fine-grained Fire and Smoke Understanding in Multimodal LLMs

SAFIRE, an 83K-image fire and smoke benchmark, shows open-source multimodal LLMs average only 61.9% accuracy on safety-critical fire reasoning.

SAFIRE is a large-scale benchmark for fire-smoke understanding in multimodal LLMs with 83K captioned images across 20 scenarios and 193K multiple-choice VQA questions spanning 10 evaluation dimensions from perception to higher-order reasoning. Annotations were built via a GPT-5.4-assisted multi-stage pipeline with MLLM majority voting. Ten open-source MLLMs (8B-38B) average 61.9% accuracy, exposing major gaps in safety-critical reasoning. Adapting vision encoders on 7% of the domain data raises fire-scene classification from 20.1% to 64.5%.

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

Scalability Analysis of Distributed Kolmogorov-Arnold Network Training on High-Performance Computing Systems

An empirical study shows distributed Kolmogorov-Arnold Network training reaches 74.7% parallel efficiency at 8 A100 GPUs, with overheads driven by All-Reduce choices.

The study evaluates data-parallel Kolmogorov-Arnold Network (KAN) training on the FinisTerrae III supercomputer using up to 8 NVIDIA A100 GPUs across 4 nodes with PyTorch Distributed Data Parallel. Strong scaling yields 5.97x speedup and 74.7% parallel efficiency at 8 GPUs, comparable to conventional deep learning workloads, while communication overhead ranges from 1.3% to 6.1%, driven mainly by All-Reduce algorithm selection and inter-node latency rather than KAN's edge-wise gradient structure. Weak scaling shows an initial single-to-multi-GPU throughput drop followed by stability, and the parameter-to-memory ratio improves with model size even as training time scales unfavorably. The authors provide GPU topology and model-size deployment guidelines for KAN training.

arXiv cs.AI / cs.LG / cs.CL·Sep 7, 16:45 UTC · 10d agoAI research1

H Company Releases NeoMME: A Family of 260M and 800M Single-Tower Multimodal Encoders That Drop the Vision Tower and Causal Decoder

H Company released NeoMME, 260M/800M single-tower multimodal encoders matching 3.75B ColQwen2.5 on ViDoRe v3 while being 14.4x smaller, under Apache 2.0.

H Company released NeoMME, a family of 262,937,906- and 793,715,032-parameter bidirectional encoders that process text and raw 32x32 image patches in a single tower, pretrained via masked diffusion and released under Apache 2.0 with day-zero Hugging Face Transformers support. NeoMME-Retriever-260M reaches 0.523 nDCG@10 on ViDoRe v3, matching 3.75B-parameter ColQwen2.5 while being 14.4x smaller; the 800M model scores 0.556. Hierarchical token pooling with int8 and binary quantization shrinks late-interaction indexes from roughly 1.5 MB to 6 kB per page while retaining 95.19% of nDCG@10; text-only BEIR retrieval remains a weak spot.

MarkTechPost·Sep 6, 21:06 UTC · 11d agoAI research1

Continual Learning Mechanisms Compose for Long-Horizon Memorization

Composing data, function, and weight anchors with merged LoRA raises 100-task long-horizon retention from 1.2% to 34.9% in continual fine-tuning.

The paper introduces long-horizon memorization: a model learns 100 query-answer tasks through continual supervised fine-tuning without retaining earlier examples or receiving task identifiers at inference. No single continual learning mechanism maintains strong retention at this horizon, so the authors compose complementary mechanisms along data/function/weight anchors and low-rank allocation rules. The best method combining all three anchors with merged LoRA ranks among the top 3 methods on all three datasets and raises average final retention from 1.2% to 34.9%, a 28-fold improvement.

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

RoboSPA: Can VLA Models Go Beyond Simple Scenes and Short-Horizon Tasks?

RoboSPA introduces a 527K-trajectory robotic benchmark with 280 task variants exposing VLA model weaknesses in spatial reasoning and long-horizon planning.

RoboSPA is a large-scale robotic manipulation dataset and benchmark for diagnosing embodied reasoning in vision-language-action models, spanning fine-grained spatial reasoning and long-horizon procedural planning. It covers 10 task categories and 56 base tasks instantiated across five difficulty levels for 280 variants, with 527K trajectories collected across multiple embodiments. Experiments on representative VLA models show current systems struggle with complex spatial relations, precise low-level execution, and memory-intensive planning.

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

RoboSPA: Can VLA Models Go Beyond Simple Scenes and Short-Horizon Tasks?

RoboSPA introduces a 527K-trajectory benchmark with 280 task variants showing current VLA models struggle with spatial reasoning and long-horizon planning.

RoboSPA is a large-scale robotic manipulation dataset and benchmark for diagnosing embodied reasoning in vision-language-action models, covering fine-grained spatial reasoning and long-horizon procedural planning. It spans 10 task categories and 56 base tasks instantiated across five difficulty levels for 280 variants, with 527K trajectories collected across multiple embodiments and diverse scenes. Diagnostic metrics go beyond binary success rates, and experiments show current VLA models struggle with complex spatial relations, precise low-level execution, and memory-intensive planning.

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

Unfold The World: Factorize 4D Properties in Reinforcing Spatial Reasoning

FactoSR factorizes 4D spatial reasoning into XY, Z, and T reinforcement-learning sub-objectives, boosting VLM performance on VSI-Bench by 5.9% and All-Angles-Bench by 4.5%.

Researchers present FactoSR, a factorized reinforcement learning framework that decomposes world-consistent reasoning into planar correspondence, depth consistency, and temporal reversibility sub-objectives. Optimizing these verifiable constraints turns the ill-posed projection recovery problem into tangible reasoning steps. Evaluations show gains of 5.9% on VSI-Bench and 4.5% on All-Angles-Bench for 3D and 4D reasoning, arguing VLMs' spatial bottleneck stems from training on 2D projections versus latent 3D geometry and temporal continuity.

Hugging Face daily papers·Sep 2, 20:00 UTC · 15d agoAI research

ShallowStream: Index Shallow then Answer Deep for Streaming Video Understanding

ShallowStream builds streaming-video retrieval indexes from shallow MLLM layers, cutting per-frame prefill latency by up to 52.1x.

ShallowStream is a framework for streaming video understanding with multimodal LLMs that uses the model's shallow layers to simultaneously encode frames and maintain an always-on lightweight retrieval index via shallow-layer KV caches, avoiding full-depth prefill for every incoming frame. At query time, shallow-layer attention scores plus a diversity-aware selection strategy retrieve relevant context frames. It reports performance on par with the strongest existing streaming methods while reducing per-frame prefill latency by up to 52.1x and 10-second end-to-end latency by up to 11.9x, with code released on GitHub.

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

TempCloze: Can Video-LLMs Identify the Missing Middle?

TempCloze benchmark tests Video-LLMs' temporal reasoning with 1,521 videos, finding temporal alignment is the primary failure mode across 31 models.

TempCloze is a video cloze benchmark in which models must identify the true missing middle clip given the beginning and ending clips, using 1,521 carefully filtered videos from seven sources, mostly long-take and egocentric footage. Distractors are constructed along three dimensions: Semantic, Alignment and Progression, with shared scenes and objects to reduce appearance cues. Evaluation of 10 proprietary and 21 open-source Video-LLMs found Alignment is the primary bottleneck, with models often recognizing plausible semantics and local event progression but struggling with temporal alignment.

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

🔬“We have foundation models for language, not for physics” — Anima Anandkumar, Bren Professor of Computing

Caltech professor Anima Anandkumar discusses Neural Operators and FourCastNet for physics modeling, arguing inductive biases beat pure token scaling.

Anima Anandkumar, Bren Professor at Caltech and co-founder of Accelerated Understanding, describes Fourier Neural Operators that learn in frequency and spherical-harmonic domains to model weather, fusion, and fluid or heat flow. Her team built FourCastNet 3, a global weather model competitive with physics-based simulations that runs on consumer-grade GPUs. She also introduced TorchLean, a framework for writing PyTorch-style networks inside the Lean proof assistant for formal verification, and was appointed to the United Nations Scientific Advisory Board. She argues physical domains resist scaling due to tiny datasets and context lengths in the hundreds of billions, so progress comes from built-in structure and physical priors.

Latent Space·Aug 26, 15:15 UTC · 22d agoAI research1

Push Technology Diffusion 6.8 allows organizations to shorten development timelines

Help Net Security·May 14, 00:00 UTC · May 14, 2022AI research