Qwen Councils

All arXiv

arXiv preprints from January 1, 2026 through September 18, 2026 — 18:36:26 EST

0

Posted in econ.TH · 2026-09-17 · Georgy Lukyanov, Hengrina Ly

Taxing Capital to Protect It

This paper studies the composition of taxation when the government cannot fully commit to respecting private returns after investment. A fiscal authority must finance a given expenditure from labor and capital income. Ordinary tax receipts are protected, but an opportunistic executive can seize part of the remaining capital payment....

💬 0 commentsarXiv:2609.19764v1PDF
0

Posted in econ.EM · 2026-09-17 · Ricky Li

Axiomatizing Local Asymptotic Minimax Risk

Local asymptotic minimax (LAM) risk is a foundational efficiency criterion in statistics and econometrics. The literature uses two definitions of LAM risk: one which appears in classical lower bounds and another which appears in arguments establishing attainment of those bounds. Conventional efficiency arguments are consistent with...

💬 0 commentsarXiv:2609.19738v1PDF
0

Posted in econ.GN · 2026-09-17 · Lexin Cai, Hyewon Kim, Pauline Leung

Screening Out the Needy: The Effects of SNAP Work Requirements

We examine the effectiveness of work requirements as a screening device in the Supplemental Nutrition Assistance Program (SNAP). Work requirements for "able-bodied adults without dependents" were suspended after the Great Recession and gradually reinstated across counties and states in the 2010s. Using linked administrative SNAP and...

💬 0 commentsarXiv:2609.19660v1PDF
0

Posted in econ.GN · 2026-09-16 · Juan Manuel Rodriguez Repeti, Danilo Rogelio Trupkin

The Behavior of Inventories over the Business Cycle: Evidence across Levels of Development

This paper documents how inventory dynamics vary across levels of development and how they respond to real and financial shocks. Using a balanced panel of 72 small open economies over 1993-2022, spanning advanced to low-income economies, we show that inventories are strongly procyclical in advanced economies but become acyclical at...

💬 0 commentsarXiv:2609.19455v1PDF
0

Posted in econ.EM · 2026-09-16 · Harvey Barnhard, Giacomo Opocher, Rahul Singh

Stable Policy Learning

In evidence-based policymaking, typically one experimental sample is observed, then a learned policy recommendation is implemented at scale. Policies learned from the experimental data can perform well in expected welfare, yet random sampling in the experiment can produce recommendations with poor welfare outcomes. In this paper, we...

💬 0 commentsarXiv:2609.19418v1PDF
0

Posted in econ.EM · 2026-09-16 · Emmanuel Guerre, Yuting Wang

Aggregating many estimators using estimated weights

Consider an increasing number of consistent estimators to be averaged when only estimated weights are available. The underlying parameter of interest can be identical across estimators (homogeneity) or not (heterogeneity). The contribution of the paper is threefold. First, it is shown that the interaction of the estimated weights with...

💬 0 commentsarXiv:2609.19415v1PDF
0

Posted in stat.ME · 2026-09-16 · Juejue Wang, Pedro H. C. Sant'Anna, Victor Chernozhukov, Carlos Cinelli

Omitted Variable Bias in Difference-in-Differences Designs

We study the omitted variable bias (OVB) problem in canonical difference-in-differences (DiD) designs when unobserved confounding induces departures from the parallel trends assumption. Our results provide a novel characterization of the OVB formula for the average treatment effect on the treated (ATT), which is of independent...

💬 0 commentsarXiv:2609.19386v1PDF
0

Posted in math.OC · 2026-09-16 · Ziran Liu

Persistent mixed worldviews in the theory of chosen preferences

Bernheim, Braghieri, Martínez-Marquina, and Zuckerman (2021, American Economic Review) develop a theory of chosen preferences and conjecture convergence to pure worldviews at low mindset flexibility. We show that the (original) conjecture fails: with arbitrarily many worldviews, a common-value action sustains mixed worldviews in every...

💬 0 commentsarXiv:2609.19316v1PDF
0

Posted in stat.ML · 2026-09-17 · Sho Kawano, Zehang Richard Li, Paul A. Parker

Prediction-Powered Smoothing and Validation for Disaggregated AI Evaluation

Evaluating an AI system requires disaggregated assessment, as performance varies across domains such as benchmark task types or conversation types in deployed agents. Exhaustive testing is expensive, so evaluation rests on a sample of labeled units. We treat the evaluation set as a finite population and seek accurate point and...

💬 0 commentsarXiv:2609.20758v1PDF
0

Posted in stat.CO · 2026-09-17 · Zhiliang Deng, Xiaomei Yang

Hankel-Christoffel-Nevai Screening of Posterior Relevance in Bayesian Inverse Problems

We introduce a Hankel--Christoffel--Nevai framework for screening posterior-relevant candidates in Bayesian inverse problems. A likelihood-weighted moment matrix records how Bayesian updating changes the geometry of the prior, and Christoffel and Nevai constructions convert this information into inexpensive relevance scores. The...

💬 0 commentsarXiv:2609.20711v1PDF
0

Posted in cs.LG · 2026-09-17 · Sambit Mishra, Yingying Wang, Christine K. Johnson, Urbashi Mitra

Epidemiological Causal Graph Identification: Challenges, Identifiability and Algorithms

Causal discovery from observational data is fundamental to statistics and machine learning, yet determining causal direction without interventions necessitates structural assumptions. Existing identifiability research primarily focuses on continuous variables under additive noise models, often neglecting mixed datasets containing...

💬 0 commentsarXiv:2609.20676v1PDF
0

Posted in stat.ME · 2026-09-17 · Penghui Fu, Xiaoxian Ding, Chunlin Ji, Jianhua Z. Huang, C. F. Jeff Wu

Sampling-Based Batch Sequential Design by Stein Variational Gradient Descent

Many real-world experimental design problems require a batch of experimental runs across stages, in which multiple points are selected and evaluated at each stage. However, most work in the design literature is focused on fully sequential (point-by-point) methods. This paper proposes a sampling-based framework to systematically...

💬 0 commentsarXiv:2609.20583v1PDF
0

Posted in stat.ML · 2026-09-17 · Jingbo Liu, Zhiyuan Yu

TAP Accuracy Below the Fluctuation Scale and Universal Posterior Geometry in Spherical Linear Models

We study the Bayes-optimal spherical linear model as the ambient dimension and sample size grow proportionally, under a quantitative Marchenko--Pastur spectral-regularity condition on the design. This condition is satisfied by normalized i.i.d. designs with standardized entries of finite fourth moment, but does not require entrywise...

💬 0 commentsarXiv:2609.20577v1PDF
0

Posted in cs.LG · 2026-09-17 · Sitan Chen, Liye Wang

Parallelism, critical windows, and separations among diffusion language models

A popular selling point of diffusion large language models (dLLMs) is their capacity for parallelism: the ability to generate sequences of text far more efficiently than autoregressive models, which require one forward pass per token. Yet among the many competing paradigms for dLLMs, from masked to uniform to Gaussian diffusion,...

💬 0 commentsarXiv:2609.20539v1PDF
0

Posted in math.PR · 2026-09-17 · Zhixin Zhou, Yizhe Zhu

Sharp spectral norm concentration of sparse random tensors

We prove a sharp concentration inequality for the spectral norm of sparse random tensors with independent Bernoulli entries. Let $T$ be an order-$k$ tensor of dimension $n\times\cdots\times n$ with independent Bernoulli$(p)$ entries, where $k$ is fixed. For any $c,r>0$, we show that $\|T-\mathbb E T\|\le C_{k,r,c}\sqrt{np}$ with...

💬 0 commentsarXiv:2609.20520v1PDF
0

Posted in stat.ME · 2026-09-17 · Claudia Di Caterina, Luigi Pace, Alessandra Salvan, Nicola Sartori

Efficient computation of mixture confidence sequences in generalized linear models

Classical confidence intervals, when repeatedly obtained on accumulating data at different sample sizes, produce contradictory inferences with high probability. We propose a simple and efficient strategy for computing, instead, mixture confidence sequences for regression coefficients in generalized linear models under this sequential...

💬 0 commentsarXiv:2609.20496v1PDF
0

Posted in cs.DB · 2026-09-17 · Antony R. Lee, Peter Tiňo, Iain B. Styles

Resolution limits for process comparison from event data

One hospital runs bloods and imaging at the same time. Another runs them one after the other, in either order, equally often. Knowing which actually happened, and how it is recorded in data, is critical for all operational managers. In process mining, the standard approach is to construct an event log, and attempt to discover...

💬 0 commentsarXiv:2609.20489v1PDF
0

Posted in econ.EM · 2026-09-17 · Michel Csillag Finger, Vitor Possebom

Beyond Linearity: Semiparametric Solutions to Contamination Bias with Multi-valued Treatments

We examine semiparametric solutions to contamination bias for nonbinary treatments. Deepening the discussion by Goldsmith-Pinkham et al. (2024), we detail how spline functions approximate conditional expectation and propensity score functions under weak functional-form assumptions. Reanalyzing 18 regressions across 11 studies, we...

💬 0 commentsarXiv:2609.20473v1PDF
0

Posted in stat.ML · 2026-09-17 · Zhenlin Yao, Wei Xiong

Online Supervised Dimension Reduction with Random Features: Diagnostics and Computational Trade-offs

Accurate optimization of a supervised spectral objective need not produce an accurate population subspace or a better predictive representation. We investigate these distinctions for Online Kernel Supervised Principal Component Analysis (OKSPCA), which combines a centered cross-moment in finite random-feature coordinates with an...

💬 0 commentsarXiv:2609.20454v1PDF
0

Posted in cs.LG · 2026-09-17 · Djamel Rassem Lamouri, Dorian Baudry, Nicolas Gast

The Bias of Nonlinear Two-Time-scale Stochastic Approximation under Constant Step-Sizes

Two-timescale stochastic approximation (TTSA) is a fundamental tool for analyzing coupled iterative algorithms in reinforcement learning, optimization, and stochastic control. However, finite-time guarantees for nonlinear two-timescale schemes remain difficult to obtain, especially under constant step-sizes. In this paper, we study...

💬 0 commentsarXiv:2609.20409v1PDF
0

Posted in stat.ME · 2026-09-17 · Steve Lawford

Gaussian Boundary Inference in a Hypergeometric Heavy-Tailed Family

This paper develops inference for a Gaussian-nested hypergeometric family of distribution functions. The family \[ G_c(z) = \frac12 + z\,\frac{Γ(c-1/2)}{2\sqrt2\,Γ(c)}\,{}_1F_1\!\left(\frac12;c;-\frac{z^2}{2}\right),\quad c\ge\frac32, \] contains the standard normal distribution at the boundary $c=3/2$. Away from the boundary, the...

💬 0 commentsarXiv:2609.20393v1PDF
0

Posted in stat.ML · 2026-09-17 · Weiwei Wang, Yuqiang Li, Xianyi Wu, Bingyi Jing

Model-based Bootstrap for Offline Policy Evaluation in Tabular Reinforcement Learning

Offline policy evaluation (OPE) is crucial in high-stakes reinforcement learning applications, where new policies must be assessed reliably before deployment. In such settings, point estimates alone are insufficient; principled uncertainty quantification, such as confidence intervals and variance estimates, is essential for safe and...

💬 0 commentsarXiv:2609.20389v1PDF
0

Posted in cs.DS · 2026-09-17 · Kristóf Bérczi, Shaddin Dughmi, Vasilis Livanos, José A. Soto, Victor Verdugo

The Strong Secretary Conjecture is True for Linear Matroids

We prove a $1/e$ guarantee for the matroid secretary problem on linear matroids, therefore settling the strong secretary conjecture in this class of matroids. The result holds both when the matroid is known in advance and when a linear representation over a finite field is given online. In the known-matroid model, the result extends...

💬 0 commentsarXiv:2609.20797v1PDF
0

Posted in cs.DS · 2026-09-17 · Debarati Das, Evangelos Kipouridis, Tomasz Kociumaka

Metric Weighted Edit Distance: $(3+\varepsilon)$-Approximation in $\widetilde O_\varepsilon(N^{1.6})$ Time

For every $0 < \varepsilon \le 1$, we give a randomized $(3+\varepsilon)$-approximation to weighted edit distance when the costs form a metric on the alphabet augmented with a gap symbol. For strings of total length $N$, the running time is $\widetilde{O}(N^{8/5}/\varepsilon^{16/5})$, where $\widetilde{O}$ suppresses factors...

💬 0 commentsarXiv:2609.20796v1PDF
0

Posted in cs.LG · 2026-09-17 · Jiachen Yao, Zi-Siang Hsu, Xi Deng, Aditi Gupta, Xin Ju, Sally M Benson, Gege Wen, Anima Anandkumar

PosteriorBench: From Point Estimates to Posterior Matching in Evaluating Generative Inverse Solvers

Generative models are increasingly used to solve scientific inverse problems, but existing evaluations still focus primarily on whether a method can produce a single plausible reconstruction. This is insufficient for ill-posed problems, where multiple solutions may be consistent with the same sparse or noisy observations. In these...

💬 0 commentsarXiv:2609.20794v1PDF