ZeroHour

Search: “d-Matrix”

32 stories

Smart search ranks by meaning as well as keywords (one row per story, last 45 days).

Dynin-Robotics: Omnimodal Unified Diffusion Vision-Language-Action Model

Dynin-Robotics unifies action, goal, and dynamics prediction in one omnimodal masked-diffusion VLA model, reaching 78.4% success on Franka Research 3 manipulation tasks.

Built on the Dynin-Omni masked-diffusion backbone, the model represents language, observations, goals, and actions as discrete tokens and is continually pretrained on roughly 1.33 million trajectories from 48 Open X-Embodiment datasets. The shared trajectory interface enables test-time scaling via goal prediction, action-candidate evaluation, and joint action/future-state refinement. It achieves competitive results on LIBERO and zero-shot LIBERO-Plus, 78.4% average success across four Franka Research 3 conditions, and up to 29.2x faster model-side action decoding from a block-parallel implementation.

Hugging Face daily papersupdated · 5d agofirst · 6d agoAI research 2 sources

d-Matrix Adopts NVIDIA NVLink Fusion for Rack-Scale XPU Deployment

d-Matrix will integrate its Raptor inference XPUs with NVIDIA NVLink Fusion, MGX racks and Spectrum-X networking for rack-scale AI factory deployment.

Inference chipmaker d-Matrix announced adoption of NVIDIA NVLink Fusion to connect its next-generation Raptor XPUs to NVIDIA's scale-up and scale-out networking, MGX rack architecture, and broader AI factory platform. NVIDIA claims 3x lower XPU-to-XPU latency than off-the-shelf Ethernet and 3 TB/s per-XPU all-to-all bandwidth via sixth-generation NVLink. d-Matrix plans to integrate Vera CPUs, ConnectX-9 SuperNICs, BlueField-4 DPUs and Spectrum-X Ethernet, with racks able to work alongside Vera Rubin NVL72 GPU systems. Other NVLink Fusion partners include AWS, Arm, Intel, Fujitsu, Marvell, MediaTek, Samsung and Cadence.

NVIDIA Blogupdated · 6h agofirst · 6d agoAI industry 2 sources

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 · 7d agoAI research1

AI Infra Summit: NVIDIA Vera Rubin and DSX Platform Advancements Showcase Energy Efficiencies of Optimizing Tokens Per Watt for AI Factories

At AI Infra Summit, NVIDIA showcased Vera Rubin and DSX gains up to 1.4x tokens per megawatt, plus Annapurna, d-Matrix, and Pinterest partnerships.

Ian Buck's AI Infra Summit keynote before 8,000+ attendees emphasized validated agentic tokens per megawatt as the emerging AI infrastructure metric. Announcements include Amazon's Annapurna Labs collaborating on NVHBM custom high-bandwidth memory, d-Matrix integrating NVLink Fusion with Raptor XPUs, and Pinterest using Blackwell plus Dynamo inference software for conversational visual discovery. Lambda reported 23% better performance per watt with DSX MaxLPS on Blackwell servers, running 19 nodes on a 16-node power budget. NVIDIA says DSX MaxLPS combined with Groq 3 LPX on Vera Rubin NVL72 targets up to 35X token throughput per megawatt versus GB200 NVL72 for 2-trillion-plus-parameter models.

NVIDIA Blog · 1d agoAI industry

VDiff-Bench: A Challenging Benchmark for Fine-Grained Image Difference Identification

VDiff-Bench, a 1,756-question benchmark, shows multimodal LLMs struggle with fine-grained image-difference identification, scoring as low as 8.7% on low-level changes.

VDiff-Bench is a multiple-choice benchmark of 1,756 four-way questions over image pairs covering 10 change categories including position, motion, color, texture, OCR/text and illumination, with curated hard negatives. Evaluation of 11 state-of-the-art open- and closed-source MLLMs shows fine-grained visual comparison remains brittle: 7-8B-scale open-source models score 52.5-70.6% on semantic changes but only 8.7-33.3% on low-level changes like noise and texture. Notably, Grok 4.3 shows a sharp performance drop on noise and texture differences, falling behind large open-source models like Kimi K2.5 and K3.

Hugging Face daily papers · 12d agoAI research

Dramatic insider warnings over AI fall flat with some in Silicon Valley

Anthropic researcher Jacob Coxon's resignation warning of AI existential risk drew Silicon Valley skepticism, while Amodei called for slowing development and global regulation.

Coxon, 27, who left Anthropic saying AI builders are 'gambling with our lives' with systems that can 'hack anything', was backed by Anthropic team lead Evan Hubinger, who put extinction risk above 10% within a decade. Executives including Grindr CEO George Arison and Nvidia's Jensen Huang dismissed the warnings as hype, with Arison directing engineers to stop using Anthropic technology. Dario Amodei posted an essay calling for slower AI development and global regulation, while Senator Bernie Sanders co-sponsored the Ban Artificial Superintelligence Act proposing a temporary pause on advanced AI development.

Unsolved Problem by Fields Medalist Breached by Two High School Students

Two high school students used Claude Opus 5 and GPT-5.6 Sol to help solve an open Lorentzian polynomials problem, posting a 75-page arXiv proof.

Aayush Bathija and Prince Rohatgi of Oak Park High School, mentored by UCLA postdoc Daniel Soskin, published the 75-page paper 'Bounded Ratios for Lorentzian Polynomials' (arXiv 2609.05341), solving an open problem in Fields Medalist June Huh's Lorentzian polynomial theory. The main structural theorem extends bounded coefficient-ratio characterization from quadratic to arbitrary-degree polynomials via discrete convexity conditions. The students used Claude Opus 5 and GPT-5.6 Sol for exploration and proof ideas but independently verified all arguments; the result follows an open letter from 25 Fields Medalists voicing concerns about AI's impact on mathematical rigor.

Rethinking Heterogeneous System Disaggregation for Subquadratic Attention

SQD disaggregates LLM inference by quadratic versus subquadratic attention layers, improving energy efficiency up to 56% on heterogeneous systems versus GPU-only baselines.

SQD (SubQuadratic Disaggregation) splits decode not by operator type but by quadratic versus subquadratic attention, matching their distinct arithmetic intensity and memory footprints. For sparse attention LLMs it separates top-k selection (requiring full KV indexing) from top-k attention plus FFN; for linear and sliding-window models it separates dense attention layers from subquadratic layers plus FFN. On an adjusted 8xB200 heterogeneous proxy, tokens-per-joule improves 53% on GLM 5.2, 31% on Nemotron 3 Ultra, and 56% on Gemma 4 31B. A Rubin plus LPX analytical model shows 1.2x-1.5x tighter achievable latencies and up to 3.6x higher throughput versus attention-FFN disaggregation.

arXiv cs.AI / cs.LG / cs.CL · 5d agoAI research

Anatomical Grounding and Leakage-Aware Multimodal Contrastive Learning for Alzheimer's Disease Classification from Structural MRI

Study of label leakage and anatomical grounding in multimodal MRI models for Alzheimer's staging shows cognitive-score fusion accuracy of 87.3% is leakage-driven.

The authors train a ResNet18 slice-based encoder with a one-layer Transformer on 1,075 ADNI-1 T1 MRI scans, using FastSurfer segmentations and YOLOv8 localization (mAP_50 above 0.96) as anatomical reference. Grad-CAM shows the image-only classifier often attends to skull and background rather than disease-relevant structures. A CLIP-style image-tabular contrastive framework organized along a label-leakage spectrum yields 87.3% three-way accuracy with cognitive scores versus 73.0% with regional volumes, and cropping to the medial temporal lobe raises image-only accuracy from 58.7% to 65.1%. Results come from single runs on a small balanced test set with reported confidence intervals.

arXiv cs.AI / cs.LG / cs.CL · 2d agoAI research1

Adaptive Gated Deepfake Detection for Low-Resolution and Resource-Constrained Environments

AdaGate-DF routes deepfake detection by image quality through dual multi-exit gates, hitting 0.9370 AUC on Celeb-DF with low inference latency.

AdaGate-DF is an adaptive gated deepfake detection framework that uses image-quality cues to send high-quality images through earlier exits, saving compute in resource-constrained settings. On Celeb-DF it achieves an AUC of 0.9370, outperforming MaD-CoRN and DefakeHop++, and reaches 0.9708 at 384x384 resolution. On FaceForensics++ it remains effective under class imbalance while balancing uncertainty-aware prediction and computational efficiency.

arXiv cs.AI / cs.LG / cs.CL · 12d agoAI research

Observational Indistinguishability and Integrity Blind Regions in Hybrid Quantum-Classical Workflows

Framework formalizes integrity blind regions in hybrid quantum-classical workflows, validated across 3,600 label interventions with conformal detection rules.

The paper presents a claim-relative evidence and reference framework for integrity of hybrid quantum-classical workflows, distinguishing structural blind regions caused by observational indistinguishability from finite-batch statistical misses. Experiments over 3,600 label interventions show exact label-path invariance for feature and prediction views. The geometry-aligned construction detects 343 of 2,700 conclusion-changing interventions using the conformal rule and 1,183 of 2,700 with the uncorrected union, with executed conformal clean false-action rates of 0.048-0.059.

arXiv cs.CR · 1d agoResearch

OracleZoom: On-Policy Self-Distillation Inspired Reference-Constrained Recursive Image Super Resolution

OracleZoom enables recursive extreme-scale image super-resolution via reference-constrained on-policy distillation, reducing hallucinations at deep zoom scales.

OracleZoom tackles recursive super-resolution, where repeated feeding of predictions back into the same model leaves deeper-scale outputs unsupervised as required source resolution grows geometrically. The framework trains on its own trajectory while carrying the last ground-truth evidence beyond the supervision boundary, combining direct and cross-scale supervision, a no-reference quality objective, a KL-constrained pretrained latent prior, and EMA consistency. Across seven datasets it achieves state-of-the-art SR quality across zoom scales, averaging 0.713 CLIPIQA with larger gains at deeper scales and significantly reduced hallucinations. Code, data, and models are publicly released.

Hugging Face daily papers · 11d agoAI research

Mi-Ripple: Restoring Images Degraded by Iterative AI Editing

Mi-Ripple is a diagnosis-guided restoration workflow that removes digital ripple artifacts introduced by iterative AI image editing while preserving structure.

Iterative reference-conditioned image editing can introduce grid-like and granular textures known as digital ripple. Mi-Ripple separates periodic lattice artifacts from content-entangled granular texture, then applies selective spectral notching, structure-aware smoothing, and cleaned-reference regeneration. In fourteen notch-only executions, whole-image residual standard deviation was 0.08-0.44 in CIELAB lightness units, and reference cleaning reduced output debris density by 45% in a paired example.

Hugging Face daily papers · 7d agoAI research

HyQuant: Hybrid-Precision Quantization for LLM Attention

HyQuant keeps most LLM attention states low-bit while preserving vertical-line tokens and local windows in high precision, maintaining near-lossless accuracy.

HyQuant is a hybrid-precision quantization framework for LLM attention that quantizes most attention states to low bits while keeping accuracy-critical vertical-line tokens and local-window states in full precision, selected via lightweight attention-pattern signals. In the prefill stage it uses a hybrid-precision attention operator, and in the decode stage it applies the same principle to KV-cache compression with fused dequantization and attention computation. Across diverse tasks, models, and datasets it maintains nearly lossless accuracy; code is available on GitHub.

Hugging Face daily papers · 20d agoAI tools & infra1

FLAT: Resampling Image and Text into 1D Flexible-Length Aligned Transmodal Tokens for Retrieval and Generation

FLAT jointly trains a multimodal encoder with text-to-image and image-to-text decoders, producing flexible-length tokens that hit 83.1 GenEval on T2I after fine-tuning.

FLAT (Flexible-Length Aligned Transmodal representations) is a pre-training framework that jointly optimizes a shared multimodal encoder with T2I and I2T decoders, combining contrastive alignment with bidirectional cross-modal generative objectives. It maps visual and textual inputs into a unified continuous 1D sequence space and uses nested dropout over prefix-K tokens for dynamic output lengths. A single pre-training stage supports cross-modal retrieval and generation (71.1 GenEval), with task-specific fine-tuning reaching 83.1 GenEval on T2I, 40.5 BLEU-4 and 138.6 CIDEr on MS-COCO captioning, and strong Recall@5 on MS-COCO and Flickr30K.

Hugging Face daily papers · 2d agoAI research

Benign Loss Landscapes Can Coexist with Worst-Case Hardness

Theory paper shows tree tensor networks contain worst-case hard targets yet benign loss landscapes, with difficulty arising from degenerate saddles.

The paper studies tree tensor networks (TTNs), which generalize deep linear networks and Tucker decompositions and embed arbitrary read-once Boolean formulas. It proves that every local minimum that is minimum-norm is global for every realizable target, so bad local minima do not distinguish typical from worst-case problems. Instead, learning difficulty arises from high-order degenerate saddle points caused by rank-deficiency, illustrated via a parity function case study, linking landscape geometry to computational hardness.

arXiv cs.AI / cs.LG / cs.CL · 5d agoAI research

Discrete Beckmann Transport Models for One-Step Language Modeling and Reasoning

DBTM achieves one-step text generation via a time-independent transport map trained directly from data, removing pretrained teacher distillation.

Discrete Beckmann Transport Models (DBTM) build a time-independent flow whose autonomous transport map provably carries any point in ambient space to a fixed point on simplex vertices in a single step. The fixed-point property is characterized by a conservation equation whose residual can be minimized directly from data, eliminating the need for a teacher flow, distillation, and time conditioning. A partial-context interpolant extension turns additional function evaluations into refinement steps rather than ODE integration steps. On language modeling and reasoning tasks, DBTM's one- and few-step generation improves quality and accuracy over discrete diffusion and continuous flow baselines.

arXiv cs.AI / cs.LG / cs.CL · 2d agoAI research1

Show HN: MultiMatte, a Promptable Image Background Removal Model

Feyn releases MultiMatte, a promptable background-removal model fine-tuned from Meta's SAM 3 via LoRA, outputting alpha mattes that beat SAM 3 on segmentation benchmarks.

Feyn introduced MultiMatte, a promptable image background-removal model built on Meta's SAM 3 (860M parameters). It modifies only 19.49M parameters (2.27%) using a rank-16 LoRA adapter and replaces binary masks with alpha mattes to handle fuzzy boundaries like hair. On the DIS-VD benchmark it scores 0.901 S-measure versus SAM 3's 0.667, and it improves on SAM 3 across all twelve evaluated splits. Training used 19,953 images for 14,000 steps with focal and Dice loss, and the merged weights are available via the nobg library and a web demo.

LimiX-2: A Contextual Mechanism Network Towards General Structured-Data Intelligence

LimiX-2 scales Contextual Mechanism Networks pretrained via context-conditional masked modeling, beating tabular foundation models on TabArena, TALENT, and BCCO benchmarks.

LimiX-2 is a new tabular model in the LimiX family, developed through model and data scaling guided by previously established scaling laws under the Contextual Mechanism Networks (CMNs) paradigm. It is pretrained with Context-Conditional Masked Modeling (CCMM) on synthetic datasets generated by structural causal models spanning diverse graph structures, functional mechanisms, and observation processes. It outperforms dataset-specific models and tabular foundation models on TabArena, TALENT, and BCCO, and its feature attention encodes direct causal relationships, enabling accurate causal skeleton recovery.

arXiv cs.AI / cs.LG / cs.CL · 1d agoAI research1

LandingAI Releases Agentic Document Extraction Gen2 with DPT-3 Pro and DPT-3 Verity

LandingAI shipped Agentic Document Extraction Gen2 with DPT-3 Pro and DPT-3 Verity parsing models, adding usage-based billing, block-tree outputs, and word-level grounding.

LandingAI has generally released Agentic Document Extraction Gen2, rebuilt around two parsing models: DPT-3 Verity for deterministic transcription of digital documents with per-word bounding boxes and confidence scores, and DPT-3 Pro for layout-aware parsing of scans, handwriting, non-Latin scripts, and LaTeX math. Billing changes from a flat 3 credits per page to a page-plus-output-character model (Pro: 1 credit/page plus 0.5 credits per 1,000 output characters on priority; Verity: 0.3 plus 0.2), with an asynchronous standard tier at 0.5x price and vendor-claimed 25-80% cost reductions. Parse v2 returns a document-page-block tree with semantic IDs, normalized bounding boxes, and line- or word-level atomic grounding, replacing flat chunks; Gen1 client code will not run against Gen2 endpoints. Deployment options include US/EU cloud, VPCs on AWS, Azure, and Google Cloud, Snowflake, and air-gapped on-premises environments, with automated model routing planned for fall 2026.

MarkTechPost · 6d agoAI tools & infra

3D Point Splatting for mmWave Radar Novel View Synthesis

Researchers propose 3DPS, a differentiable point renderer for mmWave radar novel view synthesis that outperforms optical-NVS baselines by 1.7x-5.2x.

The paper introduces 3D Point Splatting (3DPS), the first differentiable point renderer for radar, derived from the solid-angle form of the radar equation with ITU-R P.2040 material models and complex phasor splatting. On six outdoor ColoRadar scenes it reaches 0.587 mean Pearson correlation on held-out range-azimuth images, between 1.7x and 5.2x the RadarSplat, Radar Fields, and DART baselines. The same optimized scene produces ADC, complex range profile, and RA outputs via standard FFT pipelines, and training takes about 3 minutes per scene on an RTX 4090.

arXiv cs.AI / cs.LG / cs.CL · 6d agoAI research

DF26: We Cannot Tell Fake From Real Anymore

DF26 benchmark shows humans and state-of-the-art deepfake detectors perform near chance on videos generated by seven modern text-to-video models.

Researchers introduce DF26, a benchmark of 271 real and 2,420 fully synthetic videos created by seven modern video generation models, all depicting single-person public-speaking scenarios such as direct-to-camera recordings, official statements, and studio interviews. Human viewers and state-of-the-art deepfake detectors scored close to random chance at distinguishing fakes from real footage. The authors argue current evaluation protocols are insufficient and call for benchmarks that explicitly measure robustness to modern generative model distribution shifts.

Hugging Face daily papers · 10d agoAI research

Cross-Model Agreement as a Deployment-Time Reliability Signal for Automatic Polyp Segmentation

Referee-Based Quality Estimation flags unreliable polyp segmentations at inference without ground truth, reaching ROC-AUC 0.960 with SegFormer-B0 referees.

RBQE measures agreement between a primary segmentation model and an independently trained referee on a 1,223-image external benchmark drawn from four public datasets. A cross-architecture SegFormer-B0 referee achieves the strongest signal (ROC-AUC 0.960), beating a Test-Time Augmentation baseline by 0.055 ROC-AUC under an identical protocol. Excluding trivially separable empty-mask cases, ROC-AUC falls to 0.876 (SegFormer-B0) and 0.783 (same-architecture control), but RBQE's margin over baselines widens. Progressive rejection of low-agreement predictions increases mean Dice of retained outputs, supporting selective prediction at the cost of one extra forward pass.

arXiv cs.AI / cs.LG / cs.CL · 7d agoAI research

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 · 21d agoAI tools & infra1

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 · 9d agoAI research1

Privacy Failure in Split-LLM Training, The Returned Gradient Nullifies the Decoys

Researchers show split-LLM training leaks privacy via zero-valued gradients on decoy rows, exposing which activations are real despite passing forward-channel checks.

A systems-security case study of a two-node split-LLM training setup found that the returned output gradient from an Untrusted Cloud Node is exactly zero for decoy rows, revealing which rows are real. Across nine seeds, zero patterns identified real rows in 4,096 of 4,096 frames per run, and an attack on frame contents recovered 0.65 to 1.50 percentage points of extra tokens over a baseline. Both datasets passed forward-channel privacy and quality checks but failed once the returned gradient was included. Row-wise gradient clipping and noise closed the leak for roughly 0.01 nats of held-out cross-entropy, though five unmeasured attack classes remain.

Deep Learning-Based Detection of Electrical Faults and Power Quality Disturbances in Aerospace Power Systems

Compact ResNet detects electrical faults in 400 Hz aircraft power systems with 95.87 percent accuracy after deployment on Xilinx Zynq MPSoC.

The study targets multiclass fault and power quality disturbance detection in 400 Hz aerospace networks using a high-fidelity simulation model inspired by the Boeing 787 electrical architecture, covering 21 normal, disturbance, switching, open-circuit, and short-circuit conditions. Two 73,500-sample datasets are built from 1D waveforms and STFT time-frequency representations, augmented with domain randomization and class-specific GANs, and the time-series dataset is released via IEEE DataPort. A compact ResNet with 175,685 parameters achieved 96.94 percent software test accuracy, and 95.87 percent after 8-bit quantization on a Xilinx Zynq UltraScale Plus ZCU102 with 6.90 ms mean accelerator latency per record.

arXiv cs.AI / cs.LG / cs.CL · 7d agoAI research

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 · 8d 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 · 5d agoAI research

SQS: Bayesian DNN Compression through Sparse Quantized Sub-distributions

SQS unifies weight pruning and low-bit quantization via Bayesian variational learning, compressing Llama3.2 and Qwen2.5 at higher rates with comparable accuracy.

SQS introduces a unified Bayesian variational framework performing simultaneous pruning and low-bit quantization, using a spike-and-slab prior for sparsity and Gaussian Mixture Models to model quantized weights. The authors derive an efficient approximation for the intractable objective and provide a consistency result for the variational approach. Experiments on ResNet, BERT-base, Llama3.2, and Qwen2.5 show higher compression rates than prior baselines with comparable performance drops.

Hugging Face daily papers · 10d agoAI research

Lightweight Vision Transformer Compression for On-Device Plant Disease Detection in Resource-Constrained Agricultural Field Conditions

A unified ViT compression pipeline (H-BAC pruning, quantization, distillation) cuts plant-disease models 54.5x to 6.01 MB while keeping 95.13% accuracy.

Researchers combined Hessian-Balanced Adaptive Block Pruning (H-BAC), guided by second-order sensitivity estimation, with quantization and attention-based knowledge distillation to compress Vision Transformers for on-device chilli plant disease detection in India. On a 3-class cross-village, cross-device out-of-distribution dataset, the integrated pipeline reduced model size from 327.42 MB to 6.01 MB (54.5x) at 95.13 +/- 2.32% accuracy, matching the 95.13% FP32 baseline. Ablations also show a directly trained 6.01 MB INT8 student reaches 94.87% accuracy, indicating where pruning and distillation add limited value.

arXiv cs.AI / cs.LG / cs.CL · 12d agoAI research

ReMoMask-2: Latent Retrieval-Augmented Masked Motion Generation

ReMoMask-2 rebuilds retrieval in the generator's latent space for text-to-motion generation, achieving lowest FID on KIT-ML and SnapMoGen.

ReMoMask-2 is a retrieval-augmented text-to-motion framework that constructs its retrieval database directly in the generator's pre-quantization latent space and aligns text queries through a distilled lightweight projector, eliminating the representation gap. The framework combines Hierarchical Bidirectional Momentum contrastive learning, Semantic Spatial-Temporal Attention, and Topology Structured Masking to handle hierarchical motion structure. The retriever achieves state-of-the-art accuracy, and ReMoMask-2 attains the lowest FID on KIT-ML and SnapMoGen, with a single mask-transformer stage outperforming the previous two-stage pipeline while delivering the fastest inference.

Hugging Face daily papers · 9d agoAI research