We study the problem of group testing with a non-adaptive randomized algorithm in the random incidence design (RID) model where each entry in the test is chosen randomly independently from $\{0,1\}$ with a fixed probability $p$.
The property that is sufficient and necessary for a unique decoding is the separability of the tests, but unfortunately no linear time algorithm is known for such tests. In order to achieve linear-time decodable tests, the algorithms in the literature use the disjunction property that gives almost optimal number of tests.
We define a new property for the tests which we call semi-disjunction property. We show that there is a linear time decoding for such test and for $d\to \infty$ the number of tests converges to the number of tests with the separability property and is therefore optimal (in the RID model). Our analysis shows that, in the RID model, the number of tests in our algorithm is better than the one with the disjunction property even for small $d$.
Randomized Neural Network with Adaptive Forward Regularization for Online Task-free Class Incremental Learning
School of Electronic Information and Electrical Engineering(电子信息与电气工程学院);Key Laboratory of System Control(系统控制关键实验室);School of Electrical and Electronic Engineering(电气与电子工程学院);Engineering Department, College of Engineering(工程学院电子工程系);Qatar University(卡塔尔大学)
Adaptive Randomized Neural Networks for PDEs: Structure-Aware Feature Redistribution and Residual-Driven Block Enrichment
School of Mathematics and Statistics, Xi’an Jiaotong University(西安交通大学数学与统计学院);School of Mathematics and Statistics & State Key Laboratory of Multiphase Flow in Power Engineering, Xi’an Jiaotong University(西安交通大学数学与统计学院)
Challenges in Statistical Analysis of Data Collected by a Bandit Algorithm: An Empirical Exploration in Applications to Adaptively Randomized Experiments
University of Toronto(多伦多大学);Sapienza University of Rome(罗马第一大学);University of Cambridge(剑桥大学);Universitè Laval(拉瓦尔大学);Carleton College(卡尔顿学院)
几十年来,多臂强盗算法一直被认为是自适应随机实验的有用方法。在此类实验中,算法会改变分配给参与者的手臂(例如帮助学生学习的替代干预措施),目标是为尽可能多的参与者分配更高回报的手臂。我们应用强盗算法汤普森采样(TS)运行自适应实验在三个大学类。教师看到了尝试快速使用数据给他们的学生在实验中更好的武器(例如,更好地解释一个概念)的巨大价值。然而,我们的部署说明了科学家和从业者使用这种自适应实验的主要障碍:与传统的均匀随机分配相比,缺乏对特定现实世界实验的统计分析受到影响程度的量化见解(Pallmann et al,2018; FDA,2019)。因此,我们使用我们的案例研究的无处不在的双臂二进制奖励设置经验调查的影响,使用汤普森采样,而不是均匀的随机分配。在这种情况下,使用常见的统计假设检验,我们表明,使用TS收集数据可以使假阳性率(FPR;当不存在差异时错误地报告差异)和假阴性率(FNR;当存在差异时未能报告差异)增加一倍。
Nonparametric adaptive control and prediction: theory and randomized algorithms
Courant Institute of Mathematical Sciences, New York University(纽约大学柯朗数学科学研究所);Google Brain Robotics(谷歌大脑机器人部门);Massachusetts Institute of Technology(麻省理工学院)
Adaptive-Growth Randomized Neural Networks for Level-Set Computation of Multivalued Nonlinear First-Order PDEs with Hyperbolic Characteristics
School of Mathematics and Statistics, Xi’an Jiaotong University, Xi’an, Shaanxi 710049, China(数学与统计学学院,西安交通大学,西安,陕西 710049,中国);School of Mathematical Sciences & Institute of Natural Sciences, Shanghai Jiao Tong University, Shanghai 200240, China(数学科学学院及自然科学研究所,上海交通大学,上海 200240,中国);School of Mathematics and Statistics & State Key Laboratory of Multiphase Flow in Power Engineering, Xi’an Jiaotong University, Xi’an, Shaanxi 710049, China(数学与统计学学院及电力工程多相流国家重点实验室,西安交通大学,西安,陕西 710049,中国)
Lotus: Efficient LLM Training by Randomized Low-Rank Gradient Projection with Adaptive Subspace Switching
Hong Kong Baptist University, School of Science, Hong Kong, China(香港 Baptist 大学,科学学院,香港,中国);Fudan University, School of Data Science, Shanghai, China(复旦大学,数据科学学院,上海,中国);New York University, Tandon School of Engineering, New York, USA(纽约大学,Tandon 工程学院,纽约,美国)