Every paper checked — nothing hidden
All papers
Every paper checked for brief #4 of 12–19 Oct 2026 — nothing is hidden. Brief papers first.
All17,312In brief24More (on-topic)3,333Not relevant13,753Not assessed87Older351Could not confirm93Blogs with no paper266All blogs284
| Paper | Topic | Relevance | Feedback |
|---|---|---|---|
| Personalized Projected Ascent for Federated Stackelberg Optimization The paper analyzes personalized projected ascent algorithms for federated minimax problems with client-specific maximization variables. Preprint | AI safety and reliability in deployment via arxiv · 17 Oct, 06:18 | Not relevant Theoretical optimization paper, not LLM safety, guardrails, or deployment reliability. | |
| Spectrum Is Not Enough: A Random-Matrix Account of Data-Free Preconditioning for Differentially Private Learning The authors use random matrix theory to establish theoretical limits on synthetic data-free preconditioning in differentially private learning. Preprint | Small and efficient models via arxiv · 17 Oct, 06:18 | Not relevant Deals with differential privacy preconditioning, not model compression or efficient serving. | |
| Spectrum Is Not Enough: A Random-Matrix Account of Data-Free Preconditioning for Differentially Private Learning The authors use random matrix theory to establish theoretical limits on synthetic data-free preconditioning in differentially private learning. Preprint | AI safety and reliability in deployment via arxiv · 17 Oct, 06:18 | Not relevant Theoretical analysis of private learning preconditioning, not deployment safety or reliability. | |
| Spectrum Is Not Enough: A Random-Matrix Account of Data-Free Preconditioning for Differentially Private Learning The authors use random matrix theory to establish theoretical limits on synthetic data-free preconditioning in differentially private learning. Preprint | LLM evaluation and benchmarks via arxiv · 17 Oct, 06:18 | Not relevant Focuses on theoretical random-matrix bounds, not LLM benchmark evaluation. | |
| Dimension-Free PAC-Bayes Generalization for Deep Neural Networks via Dirichlet Processes The paper develops dimension-free PAC-Bayesian generalization bounds for deep neural networks using Dirichlet processes over data distributions. Preprint | Small and efficient models via arxiv · 17 Oct, 06:18 | Not relevant Investigates mathematical generalization bounds rather than efficient model compression. | |
| Dimension-Free PAC-Bayes Generalization for Deep Neural Networks via Dirichlet Processes The paper develops dimension-free PAC-Bayesian generalization bounds for deep neural networks using Dirichlet processes over data distributions. Preprint | AI safety and reliability in deployment via arxiv · 17 Oct, 06:18 | Not relevant Theoretical generalization analysis without AI deployment safety focus. | |
| Dimension-Free PAC-Bayes Generalization for Deep Neural Networks via Dirichlet Processes The paper develops dimension-free PAC-Bayesian generalization bounds for deep neural networks using Dirichlet processes over data distributions. Preprint | LLM evaluation and benchmarks via arxiv · 17 Oct, 06:18 | Not relevant Theoretical PAC-Bayes generalization paper, not an LLM benchmark. | |
| Online Quantile Omniprediction for Proper Losses The authors introduce online algorithms to generate quantile forecasts that remain accurate across multiple proper loss functions simultaneously. Preprint | Small and efficient models via arxiv · 17 Oct, 06:18 | Not relevant Focuses on loss calibration theory, not efficient model serving. | |
| Online Quantile Omniprediction for Proper Losses The authors introduce online algorithms to generate quantile forecasts that remain accurate across multiple proper loss functions simultaneously. Preprint | LLM evaluation and benchmarks via arxiv · 17 Oct, 06:18 | Not relevant Statistical quantile omniprediction theory, not an LLM benchmark. | |
| Online Quantile Omniprediction for Proper Losses The authors introduce online algorithms to generate quantile forecasts that remain accurate across multiple proper loss functions simultaneously. Preprint | AI safety and reliability in deployment via arxiv · 17 Oct, 06:18 | Not relevant Theoretical quantile forecasting analysis, not AI system safety. | |
| Honesty is the Best Policy ... or is it? Demand Management for Probabilistic Service Options The paper models demand management using probabilistic service options and analyzes provider incentives under transparency constraints. Preprint | LLM evaluation and benchmarks via arxiv · 17 Oct, 06:18 | Not relevant Studies revenue management decision processes, not LLM evaluation. | |
| Honesty is the Best Policy ... or is it? Demand Management for Probabilistic Service Options The paper models demand management using probabilistic service options and analyzes provider incentives under transparency constraints. Preprint | AI safety and reliability in deployment via arxiv · 17 Oct, 06:18 | Not relevant Focuses on customer choice manipulation in operations research, not AI safety. | |
| Honesty is the Best Policy ... or is it? Demand Management for Probabilistic Service Options The paper models demand management using probabilistic service options and analyzes provider incentives under transparency constraints. Preprint | Small and efficient models via arxiv · 17 Oct, 06:18 | Not relevant Deals with operations research demand management, not small models. | |
| Two Sample Sizes in Test-Time LLM Ensembling: Buffered ERM and Minimax Theory The authors analyze theoretical sample-complexity tradeoffs between questions and generations when ensembling multiple language models at test time. Preprint | Small and efficient models via arxiv · 17 Oct, 06:18 | Not relevant Theoretical statistical analysis of ensembling without model compression focus. | |
| Two Sample Sizes in Test-Time LLM Ensembling: Buffered ERM and Minimax Theory The authors analyze theoretical sample-complexity tradeoffs between questions and generations when ensembling multiple language models at test time. Preprint | AI safety and reliability in deployment via arxiv · 17 Oct, 06:18 | Not relevant Mathematical analysis of ensembling risk rather than deployment safety. | |
| Same Target, Different Origins: Aligning Latent Rollout for Consistent PDE Emulation The paper introduces a regularization technique that aligns internal representations across rollout origins to improve neural differential equation emulation. Preprint | AI safety and reliability in deployment via arxiv · 17 Oct, 06:18 | Not relevant Deals with scientific neural PDE emulation, not AI safety. | |
| Same Target, Different Origins: Aligning Latent Rollout for Consistent PDE Emulation The paper introduces a regularization technique that aligns internal representations across rollout origins to improve neural differential equation emulation. Preprint | LLM evaluation and benchmarks via arxiv · 17 Oct, 06:18 | Not relevant Focuses on scientific neural PDE solvers, not LLM evaluation. | |
| Same Target, Different Origins: Aligning Latent Rollout for Consistent PDE Emulation The paper introduces a regularization technique that aligns internal representations across rollout origins to improve neural differential equation emulation. Preprint | Small and efficient models via arxiv · 17 Oct, 06:18 | Not relevant Studies PDE latent consistency rather than small model efficiency. | |
| Does Compression Imply Generalization? A Minimum Description Length Perspective The authors show how prequential regret from minimum description length bounds neural network generalization error without held-out data. Preprint | LLM evaluation and benchmarks via arxiv · 17 Oct, 06:18 | Not relevant Theoretical learning theory on generalization bounds, not an LLM benchmark. | |
| Does Compression Imply Generalization? A Minimum Description Length Perspective The authors show how prequential regret from minimum description length bounds neural network generalization error without held-out data. Preprint | Small and efficient models via arxiv · 17 Oct, 06:18 | Not relevant Studies MDL theory bounds rather than practical model compression or efficiency. | |
| Does Compression Imply Generalization? A Minimum Description Length Perspective The authors show how prequential regret from minimum description length bounds neural network generalization error without held-out data. Preprint | AI safety and reliability in deployment via arxiv · 17 Oct, 06:18 | Not relevant Covers theoretical machine learning bounds, not deployment safety. | |
| RDL-Bench: A Benchmark for Task-Aware Question Answering over Relational Databases The paper introduces a benchmark to evaluate question answering systems on reasoning and predictive tasks over relational databases. Preprint | AI safety and reliability in deployment via arxiv · 17 Oct, 06:18 | Not relevant Benchmark paper for database QA, not focused on AI safety. | |
| RDL-Bench: A Benchmark for Task-Aware Question Answering over Relational Databases The paper introduces a benchmark to evaluate question answering systems on reasoning and predictive tasks over relational databases. Preprint | Small and efficient models via arxiv · 17 Oct, 06:18 | Not relevant Proposes a database QA benchmark without model efficiency contributions. | |
| Fault Detection and Bit-Error Rate Diagnostics in Optical Wireless Links Using Edge-AI The authors implement an on-device machine learning diagnostic engine on a microcontroller for optical wireless communication links. Preprint | AI safety and reliability in deployment via arxiv · 17 Oct, 06:18 | Not relevant Focuses on telecommunication link diagnostics rather than AI system safety. | |
| Fault Detection and Bit-Error Rate Diagnostics in Optical Wireless Links Using Edge-AI The authors implement an on-device machine learning diagnostic engine on a microcontroller for optical wireless communication links. Preprint | LLM evaluation and benchmarks via arxiv · 17 Oct, 06:18 | Not relevant Evaluates optical wireless telemetry diagnostics, not LLM benchmarks. | |
| Learning to Forecast on Multiple Spatiotemporal Hierarchies The paper proposes a graph neural network framework to exploit multiple spatiotemporal aggregation hierarchies for time-series forecasting. Preprint | AI safety and reliability in deployment via arxiv · 17 Oct, 06:18 | Not relevant Addresses time-series aggregation architectures, not AI deployment safety. | |
| Learning to Forecast on Multiple Spatiotemporal Hierarchies The paper proposes a graph neural network framework to exploit multiple spatiotemporal aggregation hierarchies for time-series forecasting. Preprint | Small and efficient models via arxiv · 17 Oct, 06:18 | Not relevant Proposes graph deep learning for forecasting, not model compression. | |
| Learning to Forecast on Multiple Spatiotemporal Hierarchies The paper proposes a graph neural network framework to exploit multiple spatiotemporal aggregation hierarchies for time-series forecasting. Preprint | LLM evaluation and benchmarks via arxiv · 17 Oct, 06:18 | Not relevant Focuses on spatiotemporal time-series forecasting, not LLM benchmarking. | |
| What Does History Add? Calendar Controls and Information-Timing Audits for University Trajectory Forecasting This study audits how historical information and calendar controls affect trajectory forecasting within a university simulator. Preprint | AI safety and reliability in deployment via arxiv · 17 Oct, 06:18 | Not relevant Studies trajectory simulator predictions, not AI deployment safety. | |
| What Does History Add? Calendar Controls and Information-Timing Audits for University Trajectory Forecasting This study audits how historical information and calendar controls affect trajectory forecasting within a university simulator. Preprint | Small and efficient models via arxiv · 17 Oct, 06:18 | Not relevant Investigates statistical simulator forecasting, not efficient model deployment. | |
| What Does History Add? Calendar Controls and Information-Timing Audits for University Trajectory Forecasting This study audits how historical information and calendar controls affect trajectory forecasting within a university simulator. Preprint | LLM evaluation and benchmarks via arxiv · 17 Oct, 06:18 | Not relevant Audits university simulator forecasting rather than evaluating language models. | |
| Policy-Aligned Predictive Verification for Adaptive VLA Action-Chunk Execution The paper presents a predictive verifier that decides how many actions from a vision-language-action chunk to execute safely. Preprint | Computer vision for industrial applications via arxiv · 17 Oct, 06:18 | Not relevant Focuses on general robotic manipulation policies, not industrial defect inspection. | |
| Policy-Aligned Predictive Verification for Adaptive VLA Action-Chunk Execution The paper presents a predictive verifier that decides how many actions from a vision-language-action chunk to execute safely. Preprint | Small and efficient models via arxiv · 17 Oct, 06:18 | Not relevant Focuses on action chunk selection rather than model compression. | |
| Policy-Aligned Predictive Verification for Adaptive VLA Action-Chunk Execution The paper presents a predictive verifier that decides how many actions from a vision-language-action chunk to execute safely. Preprint | AI safety and reliability in deployment via arxiv · 17 Oct, 06:18 | Not relevant Targets robotic manipulation task success rather than AI deployment safety risks. | |
| Policy-Aligned Predictive Verification for Adaptive VLA Action-Chunk Execution The paper presents a predictive verifier that decides how many actions from a vision-language-action chunk to execute safely. Preprint | LLM evaluation and benchmarks via arxiv · 17 Oct, 06:18 | Not relevant Proposes an execution verifier for robot actions, not an LLM benchmark. | |
| Each Reward to Its Relevant Tokens: Reward-Specific Token-Level Credit Assignment for Multi-Reward RL The authors propose an algorithm that assigns multi-reward reinforcement learning credit specifically to relevant response tokens. Preprint | LLM evaluation and benchmarks via arxiv · 17 Oct, 06:18 | Not relevant Proposes a multi-reward RL training method, not an LLM benchmark. | |
| Each Reward to Its Relevant Tokens: Reward-Specific Token-Level Credit Assignment for Multi-Reward RL The authors propose an algorithm that assigns multi-reward reinforcement learning credit specifically to relevant response tokens. Preprint | AI safety and reliability in deployment via arxiv · 17 Oct, 06:18 | Not relevant Focuses on multi-reward optimization for instruction following rather than deployment safety guardrails. | |
| Each Reward to Its Relevant Tokens: Reward-Specific Token-Level Credit Assignment for Multi-Reward RL The authors propose an algorithm that assigns multi-reward reinforcement learning credit specifically to relevant response tokens. Preprint | Small and efficient models via arxiv · 17 Oct, 06:18 | Not relevant Focuses on reinforcement learning credit assignment rather than efficient inference. | |
| DuET: Note-Frame Dual Encoding for Piano Performance-to-Score Transcription The paper introduces a dual-encoder transformer that jointly transcribes piano performances to scores and tracks metrical beat frames. Preprint | LLM evaluation and benchmarks via arxiv · 17 Oct, 06:18 | Not relevant Focuses on music transcription evaluation, not LLM benchmarks. | |
| DuET: Note-Frame Dual Encoding for Piano Performance-to-Score Transcription The paper introduces a dual-encoder transformer that jointly transcribes piano performances to scores and tracks metrical beat frames. Preprint | Small and efficient models via arxiv · 17 Oct, 06:18 | Not relevant Presents a dual transformer for piano transcription without efficiency focus. | |
| DuET: Note-Frame Dual Encoding for Piano Performance-to-Score Transcription The paper introduces a dual-encoder transformer that jointly transcribes piano performances to scores and tracks metrical beat frames. Preprint | AI safety and reliability in deployment via arxiv · 17 Oct, 06:18 | Not relevant Music score transcription does not address AI deployment safety. | |
| Kolmogorov-Arnold Networks: Curse of Dimensionality and Structural Bias This paper analyzes Kolmogorov-Arnold networks to show that favorable dimension scaling depends on target smoothness rather than the architecture alone. Preprint | AI safety and reliability in deployment via arxiv · 17 Oct, 06:18 | Not relevant Theoretical network capacity analysis without AI safety focus. | |
| Kolmogorov-Arnold Networks: Curse of Dimensionality and Structural Bias This paper analyzes Kolmogorov-Arnold networks to show that favorable dimension scaling depends on target smoothness rather than the architecture alone. Preprint | Small and efficient models via arxiv · 17 Oct, 06:18 | Not relevant Analyzes mathematical approximation bounds rather than practical model compression methods. | |
| Kolmogorov-Arnold Networks: Curse of Dimensionality and Structural Bias This paper analyzes Kolmogorov-Arnold networks to show that favorable dimension scaling depends on target smoothness rather than the architecture alone. Preprint | LLM evaluation and benchmarks via arxiv · 17 Oct, 06:18 | Not relevant Theoretical study of Kolmogorov-Arnold networks, not LLM benchmark evaluation. | |
| Phase Kernel Lifts Capacity of Dense Associative Memory The authors introduce a nonlinear phase kernel to expand the effective retrieval capacity of modern Hopfield networks. Preprint | Small and efficient models via arxiv · 17 Oct, 06:18 | Not relevant Focuses on theoretical Hopfield network capacity, not efficient model serving. | |
| Phase Kernel Lifts Capacity of Dense Associative Memory The authors introduce a nonlinear phase kernel to expand the effective retrieval capacity of modern Hopfield networks. Preprint | LLM evaluation and benchmarks via arxiv · 17 Oct, 06:18 | Not relevant Studies associative memory kernels rather than LLM benchmark datasets. | |
| Phase Kernel Lifts Capacity of Dense Associative Memory The authors introduce a nonlinear phase kernel to expand the effective retrieval capacity of modern Hopfield networks. Preprint | AI safety and reliability in deployment via arxiv · 17 Oct, 06:18 | Not relevant Examines memory network retrieval capacity rather than deployment safety. | |
| When the KV Cache Is Slower Than the GPU: Scaling Remote KV Tiers for Context-Parallel Prefill The paper analyzes performance bottlenecks when using remote key-value caches during context-parallel prefill in large language model serving. Preprint | AI safety and reliability in deployment via arxiv · 17 Oct, 06:18 | Not relevant Addresses latency and systems throughput, not AI safety risks. | |
| When the KV Cache Is Slower Than the GPU: Scaling Remote KV Tiers for Context-Parallel Prefill The paper analyzes performance bottlenecks when using remote key-value caches during context-parallel prefill in large language model serving. Preprint | LLM evaluation and benchmarks via arxiv · 17 Oct, 06:18 | Not relevant Focuses on serving infrastructure performance rather than LLM evaluation benchmarks. | |
| Activation-Adjacent Layer Normalization: Effects on Approximation Power The paper analyzes the mathematical approximation capabilities of neural networks when layer normalization or RMSNorm is placed directly adjacent to activations. Preprint | Small and efficient models via arxiv · 17 Oct, 06:18 | Not relevant Analyzes theoretical layer normalization bounds without addressing practical model efficiency. | |
| Activation-Adjacent Layer Normalization: Effects on Approximation Power The paper analyzes the mathematical approximation capabilities of neural networks when layer normalization or RMSNorm is placed directly adjacent to activations. Preprint | LLM evaluation and benchmarks via arxiv · 17 Oct, 06:18 | Not relevant Theoretical MLP approximation proofs rather than LLM benchmark evaluation. | |
| Activation-Adjacent Layer Normalization: Effects on Approximation Power The paper analyzes the mathematical approximation capabilities of neural networks when layer normalization or RMSNorm is placed directly adjacent to activations. Preprint | AI safety and reliability in deployment via arxiv · 17 Oct, 06:18 | Not relevant Focuses on functional approximation theory rather than AI safety. | |
| Finite-Time Guarantees for Constrained Reinforcement Learning under Partial Observability The paper develops a primal-dual reinforcement learning algorithm providing finite-time performance and constraint-satisfaction bounds under partial observability. Preprint | Small and efficient models via arxiv · 17 Oct, 06:18 | Not relevant Focuses on POMDP RL bounds, not efficient model compression. | |
| Finite-Time Guarantees for Constrained Reinforcement Learning under Partial Observability The paper develops a primal-dual reinforcement learning algorithm providing finite-time performance and constraint-satisfaction bounds under partial observability. Preprint | LLM evaluation and benchmarks via arxiv · 17 Oct, 06:18 | Not relevant Theoretical constrained RL analysis, not an LLM evaluation benchmark. | |
| Finite-Time Guarantees for Constrained Reinforcement Learning under Partial Observability The paper develops a primal-dual reinforcement learning algorithm providing finite-time performance and constraint-satisfaction bounds under partial observability. Preprint | AI safety and reliability in deployment via arxiv · 17 Oct, 06:18 | Not relevant Addresses abstract RL constraint bounds rather than real-world AI deployment safety. | |
| Reducing the Cost of Qudit State Preparation by Learning a Sparse Structure for SNAP Gates The paper presents a differentiable masking technique to learn sparse control phases for preparing bosonic qudit quantum states. Preprint | AI safety and reliability in deployment via arxiv · 17 Oct, 06:18 | Not relevant Quantum state preparation does not address AI deployment safety. | |
| Reducing the Cost of Qudit State Preparation by Learning a Sparse Structure for SNAP Gates The paper presents a differentiable masking technique to learn sparse control phases for preparing bosonic qudit quantum states. Preprint | Small and efficient models via arxiv · 17 Oct, 06:18 | Not relevant Investigates quantum physics gate optimization rather than efficient neural models. | |
| Reducing the Cost of Qudit State Preparation by Learning a Sparse Structure for SNAP Gates The paper presents a differentiable masking technique to learn sparse control phases for preparing bosonic qudit quantum states. Preprint | LLM evaluation and benchmarks via arxiv · 17 Oct, 06:18 | Not relevant Studies quantum qudit state preparation, not LLM benchmark evaluation. | |
| A Quantum Machine Learning Approach to Content-Based Media Recommendation The paper applies quantum natural language processing circuits to content-based TV programme recommendations, comparing efficiency against classical models. Preprint | AI safety and reliability in deployment via arxiv · 17 Oct, 06:18 | Not relevant Does not address AI safety, jailbreaks, or deployment guardrails. | |
| A Quantum Machine Learning Approach to Content-Based Media Recommendation The paper applies quantum natural language processing circuits to content-based TV programme recommendations, comparing efficiency against classical models. Preprint | LLM evaluation and benchmarks via arxiv · 17 Oct, 06:18 | Not relevant Evaluates a quantum model without proposing general LLM benchmark methods. |
361–420 of 13,753← PreviousNext →