Unlearning's Blind Spots: Over-Unlearning and Prototypical Relearning Attack
Analysis of machine unlearning vulnerabilities including over-unlearning and relearning attacks, with metrics for class-level unlearning quality.
Analysis of machine unlearning vulnerabilities including over-unlearning and relearning attacks, with metrics for class-level unlearning quality.
FAHNES: Hierarchical framework for feature-aware hypergraph generation addressing scalability and feature preservation in graph generation.
SHIELD: Certifiably robust continual learning framework combining interval bound propagation with hypernetworks for sequential task learning.
Method using Koopman operators to linearize and accelerate continuous normalizing flows while preserving trajectory structure.
Cost-aware stopping rules for Bayesian optimization balancing solution quality against cumulative evaluation cost.
Novel embedding representation using linear subspaces instead of vectors to capture hierarchies and compositional relationships in data.
Structural graph learning approach for RTL quality estimation in EDA workflows using graph representations beyond LLM token embeddings.
Byzantine-robust federated learning method with delayed momentum aggregation handling partial client participation and adversarial attacks.
LiMuon: Lightweight variant of Muon optimizer designed for efficient training of large language models with reduced sample complexity.
TimeRCD: Foundation model for zero-shot time series anomaly detection using synthetic data and relative context discrepancy scoring.
Analysis of loss of plasticity in continual learning caused by Hessian spectral collapse, with theoretical conditions for successful training.
MS-PAFL framework combining model splitting with privacy amplification for federated learning while maintaining accuracy under differential privacy.
ZO-Finetuner: Learning-based zeroth-order optimizer for efficient LLM fine-tuning that avoids backpropagation and reduces memory overhead.
Analysis of low-rank adaptation (LoRA) for private LLM fine-tuning with differential privacy guarantees using DP-SGD.
Method for adaptive feature selection in graph neural networks that identifies and removes unnecessary features during training.
Theoretical framework for detecting distribution shifts in streaming data using martingale-based statistical methods and Fisher information.
Research on increasing network neurons while keeping parameters constant to reduce feature interference and polysemanticity in neural networks.
PAC-Bayesian generalization bound for RL accounting for Markov dependencies via chain mixing time, addressing non-independence in sequential data.
Memory-efficient RL approach for diffusion LLMs using boundary-guided policy optimization without intractable likelihood computations.
Combines sequential Monte Carlo sampling with maximum-entropy RL to learn proposal kernels for sampling from unnormalized distributions.
Diffusion model approach for scaling multi-agent environment co-design by jointly optimizing agent policies and environment configurations.
Go-UT-Bench: fine-tuning dataset with 5264 Go code-test pairs for training LLMs on unit test generation tasks.
Deterministic inference method for LLMs across variable tensor parallel sizes to eliminate training-inference mismatch in agents and RL.
Integer-only attention mechanism for efficient Transformer inference on edge devices by eliminating softmax dequantization overhead.
Learning representation framework for neural networks across arbitrary graphs with varying feature dimensionality.
RL approach decomposing LLM policies into internal layer and modular policies via Transformer residual streams for policy optimization.
FEM-Bench: structured benchmark for evaluating code-generating LLMs on computational mechanics and scientific reasoning tasks.
Differential privacy method for certified machine unlearning using sequential noise injection across orthogonal subspaces.
Algorithm extraction technique to synthesize executable programs from Transformer weights trained on algorithmic tasks without human-written target programs.
Neural network pruning method using graph curvature theory to identify important connections and data flows.
VLM-based defense against backdoor attacks in neural networks using external semantic auditing instead of internal diagnosis.
Provable analysis of grokking phenomenon in ridge regression, demonstrating stages of overfitting and delayed generalization with gradient descent.
Proposes Gap-K% method for detecting pretraining data in LLMs using prediction gap analysis, addressing privacy and copyright concerns.
Theoretical study of multitask learning limitations, analyzing when additional data fails to improve performance in heterogeneous task settings.
Develops Stiefel manifold-based low-rank KV cache compression for LLMs reducing HBM capacity and bandwidth requirements in long-context decoding.
Develops L2D-SLDS framework for online learning-to-defer in non-stationary time series using switching linear-Gaussian state-space models.
Proposes entropy coding compression achieving 2-bit quantization for data-free model compression without functional collapse.
Introduces STPGC for topology-preserving graph coarsening with polynomial time complexity maintaining GNN performance on reduced graphs.
Proposes dgMARK decoding-guided watermarking for discrete diffusion language models exploiting unmasking order sensitivity for output protection.
Introduces SALAAD plug-and-play framework using sparse and low-rank adaptation via ADMM for constraining LLM inference compute and memory.
Proposes Gaussian-Head OFL family for one-shot federated learning reducing communication to single round with improved privacy and deployability.
Studies component structure design in Kronecker adapters for fine-tuning large models, exploring dimensions and quantity optimization.
Analyzes theoretical mechanisms behind paired sampling heuristic for Shapley value approximation in feature importance and data valuation.
Demonstrates plain Transformers can effectively solve graph link prediction without explicit structural heuristics, offering scalable alternative to GNNs.
Proposes efficient token attribution method for reasoning LLMs addressing O(M*N) complexity bottleneck and faithfulness challenges in long-horizon interpretability.
Introduces FlexRank for extracting nested low-rank components from LLMs and vision transformers enabling adaptive deployment across cost budgets.
Analyzes statistical validity of membership inference attacks for quantifying memorization and privacy risks, proposing causal evaluation methods.
Proposes Mixture of Concept Bottleneck Experts framework generalizing CBMs along multiple dimensions to improve interpretability and predictive accuracy.
Studies how neural networks learn structured operations through sequential group composition task, analyzing mechanisms of arithmetic and algorithmic computation.
Re-evaluation of Tabular Language Models on 165 datasets revealing minimal lift over baselines and questioning claimed generalization capabilities.