论文检索

隐私约束下分布式函数型数据分析的最优估计AI 解读

We systematically investigate the preservation of differential privacy in functional data analysis, beginning with functional mean estimation and extending to varying coefficient model estimation. Our work introduces a distributed learning framework involving multiple servers, each responsible for collecting several sparsely observed functions. This hierarchical setup introduces a mixed notion of privacy. Within each function, user-level differential privacy is applied to m…

局部隐私下非参数情境多臂老虎机的迁移学习AI 解读

Motivated by privacy concerns in sequential decision-making on sensitive data, we address the challenging problem of nonparametric contextual multi-armed bandits (MAB) under local differential privacy (LDP). Via a novelly designed LDP-compatible confidence bound, we propose an algorithm that achieves near-optimal regret performance, whose optimality is further supported by a first-seen minimax lower bound. We further consider the case of private transfer learning where…

用户级局部差分隐私的速率最优性与相变AI 解读

Most literature on differential privacy considers the item-level case where each user has a single observation, but a growing field is that of user-level privacy where each of the n users holds T observations and wishes to maintain the privacy of their entire collection. We derive a general minimax lower bound, which shows that, for locally private user-level estimation problems, the risk cannot, in general, be made to vanish for a fixed n even for T arbitrarily large. We…

情境动态定价：算法、最优性与局部差分隐私约束AI 解读

We study contextual dynamic pricing problems where a firm sells products to T sequentially-arriving consumers, behaving according to an unknown demand model. The firm aims to minimize its regret over a clairvoyant that knows the model in advance. The demand follows a generalized linear model (GLM), allowing for stochastic feature vectors in Rd encoding product and consumer information. We first show the optimal regret is of order dT, up to logarithmic factors, improving…

多层随机点积图：估计与在线变点检测AI 解读

Abstract We study the multilayer random dot product graph (MRDPG) model, a generalization of the random dot product graph model to multilayer networks. To estimate the edge probabilities, we deploy a tensor-based methodology and demonstrate its superiority over existing approaches. Moving to dynamic MRDPGs, we formulate and analyse an online change point detection framework, where, at each time point, we observe a realization from an MRDPG. Across layers, we assume fixed…

范旺、余怡与里纳尔多对网络潜在生长过程根与社区推断的讨论AI 解读

We congratulate Prof. Crane and Dr Xu for introducing a very interesting and appealing statistical model for Markovian network growth. The PAPER model enjoys several qualities. In particular, (i) it strikes a rare balance between analytic elegance and tractability, and expressive power; (ii) it allows for practicable algorithms for statistical inference that scale to networks of very large size, and (iii) it is very flexible and can be readily generalized to model a variety…

时间依赖下高维回归模型的变点推断AI 解读

This paper concerns the limiting distributions of change-point estimators, in a high-dimensional linear regression time-series context, where a regression object (yt,Xt)∈R×Rp is observed at every time point t∈{1,…,n}. At unknown time points, called change points, the regression coefficients change, with the jump sizes measured in ℓ2-norm. We provide limiting distributions of the change-point estimators in the regimes where the minimal jump size vanishes and where it remains…

稳健性与局部差分隐私AI 解读

It is of soaring demand to develop statistical analysis tools that are robust against contamination as well as preserving individual data owners’ privacy. In spite of the fact that both topics host a rich body of literature, to the best of our knowledge, we are the first to systematically study the connections between the optimality under Huber’s contamination model and the local differential privacy (LDP) constraints. In this paper, we start with a general minimax lower…

稀疏动态网络中变点的最优检测与定位AI 解读

We study the problem of change point localization in dynamic networks models. We assume that we observe a sequence of independent adjacency matrices of the same size, each corresponding to a realization of an unknown inhomogeneous Bernoulli model. The underlying distribution of the adjacency matrices are piecewise constant, and may change over a subset of the time points, called change points. We are concerned with recovering the unknown number and positions of the change…

Cox模型中Lasso的预言机不等式AI 解读

We study the absolute penalized maximum partial likelihood estimator in sparse, high-dimensional Cox proportional hazards regression models where the number of time-dependent covariates can be larger than the sample size. We establish oracle inequalities based on natural extensions of the compatibility and cone invertibility factors of the Hessian matrix at the true regression coefficients. Similar results based on an extension of the restricted eigenvalue can be also proved…