Procedural Fairness in Machine Learning
Defines and formalizes procedural fairness in machine learning models drawing from philosophy and psychology, addressing fairness beyond distributive metrics.
Defines and formalizes procedural fairness in machine learning models drawing from philosophy and psychology, addressing fairness beyond distributive metrics.
Analyzes parameter-efficient fine-tuning for continual learning using Neural Tangent Kernel theory to understand model adaptation and catastrophic forgetting mitigation.
Physics-inspired neural framework using graph neural networks to solve large-scale graph coloring combinatorial optimization problems near algorithmic phase transitions.
Proposes label unlearning method for vertical federated learning using representation-level manifold mixup to enable privacy-preserving model unlearning.
Model-agnostic explanation technique integrating concept-based approaches with diverse explanation forms beyond attribution methods.
Reinforcement learning framework for aligning few-step diffusion models with downstream objectives using stepwise policy optimization.
Neuro-symbolic framework automating discovery of analytical solutions to differential equations using formal grammars and continuous search.
Theoretical analysis of sample complexity for offline reinforcement learning with f-divergence regularization in contextual bandits.
Evaluation of MLP-Mixer architectures for forecasting irregular multivariate time series with missing values.
Alternative to Integrated Gradients for neural network interpretability using model-induced metrics instead of straight attribution paths.
Unsupervised geometric deep learning framework for capturing local and global graph structure using hourglass autoencoder.
Continual learning method using sample compression theory to provide computable guarantees while avoiding catastrophic forgetting.
Extension of regret minimization algorithms for optimal experimental design and active learning sample selection.
Method for improving transferable adversarial attacks via random parameter pruning to reduce reliance on small parameter subsets.
Compression technique for large language models using global rank and sparsity optimization with layer-wise weight allocation.
Framework for uncertainty quantification with corrupted or missing labels using conformal prediction with robust re-weighting.
Large-scale benchmark for evaluating machine learning solvers on combinatorial optimization using real-world industrial datasets.
Information geometry perspective on diffusion model latent spaces, analyzing deterministic and stochastic decoders.
Theoretical analysis of Lipschitz continuity properties for neural networks operating on set-structured data.
Research on whether language models can learn to evade latent-space safety monitors, with implications for LLM alignment and security.
Framework for discovering continuous motor motifs in animal behavior using latent basis functions instead of discrete syllables.
Statistical framework for evaluating LLM-as-a-judge systems, addressing reliability and bias issues in automated LLM output evaluation.
Flow matching approach for probabilistic forecasting of dynamical systems using physical perturbations instead of standard Gaussian perturbations.
Silent Gradients approach for training VAEs by restricting decoder architecture to reduce gradient estimation variance.
Online time series forecasting method using feature adjustment to handle distribution shift in sequential data deployment.
Sparse PCA method using random matrix theory for dimensionality reduction in noisy single-cell RNA-seq data.
rBridge framework enabling small proxy models (≤1B params) to predict reasoning performance of larger LLMs, optimizing dataset scaling.
Bayesian optimization method for bilevel optimization problems with expensive black-box functions at both levels.
Theoretical analysis of softmax attention mechanisms in LLMs through single-location regression task, addressing why softmax dominates alternative activation functions.
Study of compute-optimal allocation between full-precision and quantization-aware training phases for neural networks.
Dynamic safety monitoring system for LLMs that adaptively adjusts computation based on input difficulty.
Method for improving masked diffusion models by learning better unmasking policies beyond rule-based position scheduling.
Imitation learning approach for training models with multiple acceptable answers from limited correct demonstrations.
Method for learning probability distributions on simplexes via smooth bijections and Aitchison geometry.
UniQL framework combining quantization and low-rank compression with adaptive on-device pruning for edge LLM deployment.
Post-training method achieving 99.6% attention sparsity without performance loss for mechanistic interpretability research.
WebGym: largest open-source environment with 300k tasks for training visual web agents on realistic websites.
Confidence-Variance theory framework for improved pseudo-label selection in semi-supervised learning beyond fixed thresholds.
Method for optimizing interaction between feature alignment and target fitting in cross-modal model fine-tuning.
Framework for learning Hamiltonian flow maps to enable stable large-timestep molecular dynamics simulations.
Data-free early stopping framework for federated learning using task vector growth rate monitoring.
EPIAGENT agentic framework that automatically synthesizes and calibrates epidemiological simulators via iterative program synthesis.
Framework for score-based density ratio estimation addressing path-variance issues in practical training objectives.
Theoretical analysis of phase transitions in neural network feature learning on multi-index models.
Technique to detect misbehaviors and hallucinations in large vision-language models using evidential uncertainty quantification.
Method for training ensemble models that quantify epistemic uncertainty via distributionally robust optimization.
Study of LLM scaling paradox showing larger compressor models can reduce context reconstruction faithfulness despite lower training loss.
Novel sequence architecture using Conformal Geometric Algebra instead of linear operations for improved generalization and interpretability.
On-policy distillation method that aligns student models with teacher logit distributions, theoretically framed as KL-constrained RL with reward extrapolation.
Analysis of multilingual data curation across 13 languages for 20-trillion-token dataset, addressing multilinguality challenges in foundation models.