每日简报

ChatGPT 能否预测股价走势？收益可预测性与大语言模型AI 解读

We document the capability of large language models (LLMs) like ChatGPT to predict stock market reactions from news headlines without direct financial training. Using post-knowledge-cutoff headlines, GPT-4 captures initial market responses, achieving approximately 90% portfolio-day hit rates for the non-tradable initial reaction. GPT-4 scores also significantly predict the subsequent drift, especially for small stocks and negative news. Forecasting ability generally…

数据增强的高斯与非高斯普适性AI 解读

We provide universality results that quantify how data augmentation affects the variance and limiting distribution of estimates through simple surrogates, and analyze several specific models in detail. The results confirm some observations made in machine learning practice, but also lead to unexpected findings: Data augmentation may increase rather than decrease the uncertainty of estimates, such as the empirical prediction risk. It can act as a regularizer, but fails to do…

用匹配自适应随机化推断重新评估激素替代疗法对心脏病的影响AI 解读

Matching is an appealing way to design observational studies because it mimics the data structure produced by stratified randomized trials, pairing treated individuals with similar controls. After matching, inference is often conducted using methods tailored for stratified randomized trials in which treatments are permuted within matched pairs. However, in observational studies, matched pairs are not predetermined before treatment; instead, they are constructed based on…

通过潜在空间分布匹配进行半监督生成学习AI 解读

We introduce Latent Space Distribution Matching (LSDM), a novel framework for semi-supervised generative modeling of conditional distributions. LSDM operates in two stages: (i) learning a low-dimensional latent space from both paired and unpaired data, and (ii) performing joint distribution matching in this space via the 1-Wasserstein distance, using only paired data. This two-step approach minimizes an upper bound on the 1-Wasserstein distance between joint distributions,…

依赖结构下的聚类后推断AI 解读

Recent work by Gao et al. (2024) has laid the foundations for post-clustering inference, establishing a theoretical framework allowing to test for differences between means of estimated clusters. Additionally, they studied the estimation of unknown parameters while controlling the selective type I error. However, their theory was developed for independent observations identically distributed as p-dimensional Gaussian variables, where the parameter estimation could only be…

MOSAiC：多站点压缩风险函数的一次性聚合AI 解读

Multi-center research has strengthened the generalizability and reproducibility of scientific findings, yet multi-site inference in modern distributed research networks remains constrained by privacy regulations, heterogeneous site characteristics, and the logistical burden of human-in-the-loop, multi-round communication. In this work, we distill these operational constraints into four mathematical requirements for practical distributed inference and introduce MOSAiC, a…

高维噪声下的广义稳健自适应带宽多视图流形学习AI 解读

Multiview datasets are common in scientific and engineering applications, yet existing fusion methods offer limited theoretical guarantees, particularly in the presence of heterogeneous and high-dimensional noise. We propose Generalized Robust Adaptive-Bandwidth Multiview Diffusion Maps (GRAB-MDM), a new kernel-based diffusion geometry framework for integrating multiple noisy data sources. The key innovation of GRAB-MDM is a view-dependent bandwidth selection strategy that…

交叉设计的因果效应、有效估计与稳健推断AI 解读

Crossover designs randomly assign each unit to receive a sequence of treatments. By comparing outcomes within the same unit, these designs can effectively eliminate between-unit variation and facilitate the identification of both instantaneous effects of current treatments and carryover effects from past treatments. They are widely used in traditional biomedical studies and are increasingly adopted in modern digital platforms. However, standard analyses of crossover designs…

基于张量收缩的高维张量信号对齐与匹配检验AI 解读

We consider two hypothesis testing problems for low-rank and high-dimensional tensor signals, namely the tensor signal alignment and tensor signal matching problems. These problems are challenging due to the high dimension of tensors and the lack of suitable test statistics. By exploiting a recent tensor contraction method, we propose and validate relevant test statistics using eigenvalues of a data matrix resulting from the tensor contraction. The matrix entries exhibit…

SIMPLE-RC：非尖锐原假设与弱信号下的群组网络推断AI 解读

Large-scale network inference with uncertainty quantification has important applications in natural, social and medical sciences. The recent work of Fan et al. (J. R. Stat. Soc. Ser. B. Stat. Methodol. 84 (2022) 630–653) introduced a general framework of statistical inference on membership profiles in large networks (SIMPLE) for testing the sharp null hypothesis that a pair of given nodes share the same membership profile. In real applications, there are often groups of…

神经网络雅可比矩阵的谱渐近：收敛、普适性与相变AI 解读

We study the spectral properties of the Jacobian matrix in artificial neural networks and establish both its limiting spectral distribution and the second-order fluctuations of its spectrum. Our analysis uncovers fundamental phenomena, including universality properties with respect to the weight distribution and a phase transition in spectral behavior driven by the choice of activation function. Leveraging tools from random matrix theory, we first analyze a class of…

基于预测生成树方法的贝叶斯空间区域划分一致估计AI 解读

Bayesian model-based spatial clustering methods are widely used for their flexibility in estimating latent clusters with an unknown number of clusters while accounting for spatial proximity. Many existing methods are designed for clustering finite spatial units, limiting their ability to make predictions or may impose restrictive geometric constraints on the shapes of subregions. Furthermore, the posterior clustering consistency theory of spatial clustering models remains…

空间混杂下高斯随机场回归斜率的填充渐近一致可估性AI 解读

The problem of estimating the slope parameter in regression between two spatial processes under confounding by an unmeasured spatial process has received widespread attention in the recent statistical literature. Yet, a fundamental question remains unresolved: when is this slope consistently estimable under spatial confounding, with existing insights being largely empirical or estimator-specific. In this manuscript, we characterize conditions for consistent estimability of…

流形上的粒度平滑AI 解读

Given a random sample from a density function supported on a manifold M, a new method for the estimating highest density regions of the underlying population is introduced. The new proposal is based on the empirical version of the opening operator from mathematical morphology combined with a preliminary estimator of the density function. This results in an estimator that is easy-to-compute since it simply consists of a list of centers and a radius r that are adequately…

二维 Navier–Stokes 方程的数据同化：后验测度的最优高斯渐近性质AI 解读

A functional Bernstein–von Mises theorem is proved for posterior measures arising in a data assimilation problem with the two-dimensional Navier–Stokes equation where a Gaussian process prior is assigned to the initial condition of the system. The posterior measure, which provides the update in the space of all trajectories arising from a discrete sample of the (deterministic) dynamics, is shown to be approximated by a Gaussian random vector field obtained as the solution to…

半收缩漂移分数布朗运动驱动随机微分方程的平稳密度快速估计AI 解读

We study the estimation of the invariant density of additive fractional stochastic differential equations with Hurst parameter H∈(0,1). We first focus on continuous observations and develop a kernel-based estimator achieving faster convergence rates than previously available. This result stems from a martingale decomposition combined with new bounds on the (conditional) convergence in total variation to equilibrium of fractional SDEs. For H<1/2, we further refine the rates…

基于抛物型Monge–Ampère偏微分方程的无遗憾生成建模AI 解读

We introduce a novel generative modeling framework based on a discretized parabolic Monge–Ampère PDE, which emerges as a continuous limit of the Sinkhorn algorithm commonly used in optimal transport. Our method performs iterative refinement in the space of Brenier maps using a mirror gradient descent step. We establish theoretical guarantees for generative modeling through the lens of no-regret analysis, demonstrating that the iterates converge to the optimal Brenier map…

从杀死扩散过程推断扩散率AI 解读

We consider diffusion of independent molecules in an insulated Euclidean domain with unknown diffusivity parameter. At a random time and position, the molecules may bind and stop diffusing in dependence of a given “binding potential.” The binding process can be modeled by an additive random functional corresponding to the canonical construction of a “killed” diffusion Markov process. We study the problem of conducting inference on the infinite-dimensional diffusion parameter…

异质性调整下分布式精度矩阵的最优整合估计AI 解读

Distributed learning offers a practical solution for the integrative analysis of multisource datasets, especially under privacy or communication constraints. However, addressing prospective distributional heterogeneity and ensuring communication efficiency pose significant challenges on distributed statistical analysis. In this article we focus on integrative estimation of distributed heterogeneous precision matrices, a crucial task related to joint precision matrix…

异质性面板数据模型的估计及其在项目评估中的应用AI 解读

This article studies panel data models with two-dimensional unobserved slope heterogeneity and interactive fixed effects. We propose a two-step approach to estimate the parameters in the model. We apply the proposed model to estimate heterogeneous treatment effects at both individual and aggregate levels. Monte Carlo simulations show that the proposed estimators perform remarkably well in finite samples in comparison with some existing methods such as the synthetic control…

半参数广义帕累托模型中的尾部期望分位数估计AI 解读

Expectiles have received increasing attention as a market risk measure that is both coherent and elicitable. They are defined as a least squares analog to quantiles. Their estimation from heavy-tailed loss data in an extreme value framework is an important and difficult problem, especially when the target tail expectile is beyond the range of the data. This problem has been studied only fairly recently, using solely the Weissman extrapolation method. The competing…

马尔可夫采样下随机梯度下降的在线协方差估计AI 解读

We investigate the online overlapping batch-means covariance estimator for Stochastic Gradient Descent (SGD) under Markovian sampling. Convergence rates of order $O\big(\sqrt{d}\,n^{-1/8}(\log n)^{1/4}\big)$ and $O\big(\sqrt{d}\,n^{-1/8}\big)$ are established under state-dependent and state-independent Markovian sampling, respectively, where $d$ is the dimensionality and $n$ denotes observations or SGD iterations. These rates match the best-known convergence rate for…

预印本版本摘要 · 查看来源

多因子线性资产定价模型 GMM 估计中的效率与定价精度权衡AI 解读

Even though a multi-factor linear asset pricing model can be equivalently represented in a Beta or in a stochastic discount factor (SDF) form, its inferential efficiency and pricing accuracy features may differ when estimated by the generalized method of moments (GMM), both in small and in large samples. We derive the analytical asymptotic variance of the Beta and the SDF estimators under GMM and find that the SDF approach is likely to be less efficient but to yield more…

近端估计与推断AI 解读

Abstract We develop a convex-analytic framework for constructing and analyzing a broad class of penalized estimators. Our method defines penalized estimators by applying proximal operators to benchmark estimators, rather than by penalizing the benchmark criterion itself. We establish general finite-sample properties, derive unified asymptotic distribution results, and provide tractable conditions for oracle selection and oracle asymptotic efficiency. We then apply the…