Constant-Factor Approximations for Doubly Constrained Fair k-Center, k-Median and k-Means
arXiv paper on constant-factor approximation algorithms for fair k-clustering with demographic constraints.
arXiv paper on constant-factor approximation algorithms for fair k-clustering with demographic constraints.
arXiv paper on backward error analysis and convergence for linear system solvers in numerical linear algebra.
arXiv paper applying YOLOv12 deep learning model for multiclass acute myeloid leukemia cell classification.
arXiv paper on ST-STORM self-supervised learning approach for appearance-based image representation.
arXiv paper on sentiment analysis dataset and LLM-based model for German sign language fairy tales.
arXiv paper on AtManRL method using differentiable attention for faithful chain-of-thought reasoning in LLMs.
arXiv paper on adaptive multi-fidelity optimization with cost-bias tradeoffs and learning rate analysis.
arXiv paper on Information Router to mitigate modality dominance in vision-language models.
arXiv paper proposing framework for informal theorem proving with LLMs using insight-driven reasoning.
arXiv paper on ACSESS method for automatic combination of sample selection strategies in few-shot LLM learning.
arXiv paper proposing HetSheaf, a framework for heterogeneous graph neural networks across different node/edge types.
arXiv paper on HetSheaf framework for heterogeneous graph neural networks supporting multiple node/edge types in real-world applications.
arXiv paper introducing Transformer Neural Processes addressing O(n²) attention bottleneck in Neural Processes with kernel regression.
arXiv paper on Few-Shot Preference Optimization (FSPO) for personalizing LLMs using meta-learning on synthetic preference data.
arXiv paper on AutoNFS, automatic neural feature selection for high-dimensional tabular data with interpretability and efficiency focus.
arXiv paper on Federated Prototype Learning combining textual semantics with visual representations to handle heterogeneous federated learning.
Information-geometric framework for artificial curiosity in sparse-reward RL using intrinsic rewards invariant to representation.
Theoretical and empirical analysis of decentralized learning algorithms comparing multi-stream random walk and asynchronous gossip approaches.
Histogram-based parameter-efficient tuning (HPT) technique for transfer learning capturing target domain statistics in sonar classification.
Softpick: Rectified softmax replacement for transformer attention eliminating attention sink and reducing activations with improved quantization.
ChemAmp: Framework for composable LLM agents in chemistry using tool amplification to enhance multi-tool orchestration capabilities.
Token significance-aware RL method for LLM reasoning that optimizes token-level contributions rather than uniform length penalties.
PyLO: PyTorch package making learned optimizers accessible, providing drop-in replacements for standard optimizers like Adam.
HiPreNets: Progressive training approach for neural networks achieving high precision in L-infinity norm error for safety-critical applications.
Analysis of exploration-exploitation bias in offline evaluation of linear bandit recommender systems using contextual bandits.
Self-aligned reward (SAR) method for LLM reasoning that provides fine-grained guidance beyond binary correctness to improve efficiency and accuracy.
Distributionally robust optimization approach for RLHF alignment addressing overoptimization in LLM training via relative reward regression.
SmilesGEN: VAE-based generative model using multi-objective RL for de novo drug molecule generation considering phenotypic effects.
Empirical study of scaling behaviors in RL post-training for LLMs across Qwen2.5 models (0.5B-72B) focused on mathematical reasoning performance.
Novel kernel SGD algorithm using spherical radial basis functions and regularization strategy for large-scale supervised learning with general losses.
COMPASS benchmark evaluating LLM agents' ability to perform constrained optimization in multi-turn conversations for travel planning and scheduling tasks.
Study on entropy regularization with adaptive coefficients to improve LLM reasoning in reinforcement learning with verifiable rewards, addressing policy collapse.
Research on optimal hyperparameters (clipping bound and batch size) for differentially private transfer learning, addressing theory-practice gaps.
Systematic study demonstrating that enhancing LLM reasoning capabilities paradoxically increases tool hallucination in agent deployment scenarios.
Training-free in-context distillation with self-consistency cascades to reduce LLM agent inference costs while maintaining quality and iteration speed.
Approach using LLMs as lossless encoders/decoders for invertible problems like logic table to HDL conversion, mitigating hallucinations and omissions.
Framework teaching LLMs to predict chemical reaction mechanisms using arrow-pushing formalism notation for computer-assisted synthesis planning.
CadLLM training-free acceleration method for diffusion-based LLM inference using confidence-aware adaptive control of generation parameters.
Group Relative Policy Optimization method for improving consistency and reliability of LLM recommendations across semantically equivalent prompts.
Dynamic tool dependency retrieval method for LLM-based function calling agents, improving tool selection and reducing context length for on-device agents.
Federated learning approach for traffic prediction using adaptive prompts, enabling privacy-preserving collaborative training across distributed data.
CoMeT architecture enabling LLMs to process arbitrarily long sequences with constant memory and linear time complexity via efficient plug-in module.
Unsupervised domain adaptation for radioisotope identification in gamma spectroscopy using simulation-to-reality transfer learning.
Empirical analysis of adversarial attacks on safety-aligned LLMs showing polynomial-to-exponential growth in attack success rates with prompt injection.
Proves attention sinks are functionally necessary in softmax transformers for certain tasks, formalizing their role beyond optimization artifacts.
Continual learning framework for Fourier Neural Operators enabling model adaptation to new data distributions without retraining on prior data.
Dynamical analysis of MLP training through saddle structures, explaining vanishing gradients and overfitting phenomena.
Hybrid language models mixing RNNs and attention mechanisms, comparing performance advantages over pure transformers with theoretical and practical evidence.
Proposes Neural Computers that unify computation, memory, and I/O in learned runtime states, exploring general-purpose neural machine architectures.
Leave-one-out analysis for evaluating SVG generation beyond visual similarity, assessing structural editability and reusability.