EchoRL: Reinforcement Learning via Rollout Echoing
Reinforcement learning method via rollout echoing addresses reward signal collapse in LLM post-training for improved reasoning capabilities.
Reinforcement learning method via rollout echoing addresses reward signal collapse in LLM post-training for improved reasoning capabilities.
Introduces spectral position metric to explain neural scaling laws via eigenvalue distribution of empirical neural tangent kernel.
Sparse autoencoders for interpreting neural network representations lack stability across training runs; characterizes instability sources and proposes solutions.
Theoretical analysis of linear recurrent networks as memory units in partially observable RL, proving they can reproduce belief state logits in HMMs.
In-context learning enables LLMs to perform tabular prediction without fine-tuning; studies post-hoc recourse methods for high-stakes predictions on tabular data.
Self-supervised contrastive RL framework with 64+ layer networks for long-horizon planning using survival value learning instead of contrastive losses.
arXiv paper on representation learning in RL using successor and default representations for spatio-temporal abstraction and credit assignment.
Study of localized failures in machine unlearning showing pointwise prediction discrepancies masked by aggregate evaluation metrics.
Opponent modeling approach for multi-agent reinforcement learning that generalizes intent representation beyond fixed a priori episode information.
Generalization improvement method using unlabeled data and local inconsistency measures derived from information-geometric analysis.
Python library for characterizing dataset shifts and temporal/multi-source distribution changes to support robust AI development and deployment.
Structured token mixing framework for language models balancing decoding speed and memory efficiency in long-range dependency learning.
Unified theoretical framework for generative models using Wasserstein gradient flows and Jordan-Kinderlehrer-Otto discretization scheme.
Scalable higher-order graph neural networks using maximal clique complexes and simplified Weisfeiler-Leman tests for improved expressivity.
Multi-objective reinforcement learning framework combining max-min fairness criterion with explicit constraint satisfaction for policy optimization.
Collaborative learning framework for dynamic graph models with privacy-preserving partitioned data training on evolving graph structures.
Efficient multi-turn LLM optimization method combining decoupled rollouts with importance-weighted fine-tuning for interactive reinforcement learning settings.
Compact MoE training framework designed to be agent-native, enabling AI coding agents to automate training-framework development for mixture-of-experts models.
Using LLMs as surrogate models to predict GPU kernel runtime, reducing optimization costs for kernel search with evolutionary and coding agents.
Improved LoRA fine-tuning method addressing parameter invariance through balanced conditioning to accelerate convergence of large language models.
Mechanistic study of how transformers compose skills for arithmetic tasks, analyzing compositional generalization in LLMs through controlled experiments.
Methods for efficiently sampling molecular Boltzmann distributions using iteratively finetuned diffusion models with importance sampling.
Research on optimizing Graph Neural Network scalability through I/O-aware kernel implementations to reduce memory bottlenecks in sparse, irregular computations.
ReuseRL framework for training LLM agents via RL using Minimum Description Length principle to learn reusable skill dictionaries.
Studies feature death in sparse autoencoders that decompose neural network activations into interpretable features, analyzing activation outliers.
Analysis of positional vs symbolic attention heads in Transformers, studying learning dynamics and length generalization with RoPE.
Masked representation learning approach for gene expression data using foundation models, addressing technical noise in RNA sequencing.
CHARM: Transformer encoder with channel-level textual descriptions for multivariate time-series representation learning using JEPA.
Theoretical analysis of error feedback algorithms in distributed optimization, comparing variants for communication-efficient gradient compression.
TRINE: single-bitstream FPGA accelerator for end-to-end multimodal AI inference combining ViTs, CNNs, GNNs without reconfiguration.
Kernel Foundry: diagnosis-driven evolutionary framework combining LLMs and retrieval-augmentation for automatic GPU kernel optimization.
Gradient-free training approach using low-rank evolution strategies for spiking neural networks on neuromorphic hardware.
EARLY framework using evolutionary algorithms to optimize architecture and hyperparameters of Echo State Networks for temporal learning tasks.
Dictionary learning compression technique for 3D Gaussian Splatting models to reduce memory footprint and improve deployment efficiency.
Framework for autonomous LLM-based agents to execute end-to-end data engineering pipelines for model specialization without human-designed workflows.
Evaluates generalistic vs. domain-specific embeddings for clinical coding retrieval in non-English languages, proposes LLM data generation to improve recall.
True self-avoiding walk mechanism for improving empirical integral estimation via adaptive MCMC with penalized transition probabilities.
Compares strategies to improve speculative decoding efficiency for multilingual LLM inference, addressing poor draft model performance in non-English languages.
ZAPS-DA reduces action jitter in continuous control policies without phase lag by decoupling smoothness from RL gradient via framework approach.
CacheProbe audits prompt cache isolation in LLM gateway APIs, exposing timing attack and metadata disclosure vulnerabilities in caching implementations.
Analyzes Bradley-Terry reward learning from best-of-N preference data, clarifies target quantity and design principles for N and base distribution selection.
Demonstrates universal LLM reliability is impossible across infinite tasks, proposes operationally-bounded patch approach for deployed system error management.
Rationalize framework enables shared semantic reasoning between humans and LLMs through complementary role pairs for collaborative data-driven sensemaking.
Characterizes indirect prompt injection attacks on ReAct agents via tool observation loops, analyzing injection depth, payload framing, and turn-budget sensitivity.
Applies mathematical morphology theory to clustering algorithm preserving shape/density with intrinsic noise removal and diverse growth patterns.
Equivariant latent alignment via flow matching under group symmetries for geometry-aware generative models and novel view synthesis.
SAGE: novelty-detection gate using von Mises-Fisher density estimation to manage memory evolution in agentic LLMs with principled write-side control.
Analyzes whether final layer is sufficient for uncertainty quantification in DNNs via Bayesian GLM linearization for safety-critical AI deployment.
Formalizes pairwise reference alignment as ordinal observable for model evaluation, clarifying what quantity is measured in preference-based LLM alignment.
XLGoBench synthetic benchmark detects cross-lingual capability gaps in LLMs through algorithmic tasks with scalable complexity levels.