惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

GbyAI
GbyAI
WordPress大学
WordPress大学
D
DataBreaches.Net
腾讯CDC
小众软件
小众软件
B
Blog RSS Feed
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
T
The Blog of Author Tim Ferriss
MongoDB | Blog
MongoDB | Blog
U
Unit 42
Y
Y Combinator Blog
V
V2EX
I
InfoQ
D
Docker
量子位
N
Netflix TechBlog - Medium
Recent Announcements
Recent Announcements
A
About on SuperTechFans
博客园 - 叶小钗
大猫的无限游戏
大猫的无限游戏
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
B
Blog
阮一峰的网络日志
阮一峰的网络日志
MyScale Blog
MyScale Blog

math.ST updates on arXiv.org

What is Learnable in Valiant's Theory of the Learnable? Learning Perturbations to Extrapolate Your LLM Byzantine-Robust Distributed Sparse Learning Revisited The Sample Complexity of Multiple Change Point Identification under Bandit Feedback A proximal gradient algorithm for composite log-concave sampling Model-based Bootstrap of Controlled Markov Chains Approximation of Maximally Monotone Operators : A Graph Convergence Perspective Posterior Contraction Rates for Sparse Kolmogorov-Arnold Networks in Anisotropic Besov Spaces MIST: Reliable Streaming Decision Trees for Online Class-Incremental Learning via McDiarmid Bound A Spectral Framework for Closed-Form Relative Density Estimation Fast Rates for Offline Contextual Bandits with Forward-KL Regularization under Single-Policy Concentrability Higher-Order Equilibrium Tracking for EM-Compressible Online Estimation Scaling Limits of Long-Context Transformers A Note on Non-Negative $L_1$-Approximating Polynomials Susceptibilities and Patterning: A Primer on Linear Response in Bayesian Learning Linear Response Estimators for Singular Statistical Models Statistical inference with belief functions: A survey Robust stochastic first order methods in heavy-tailed noise via medoid mini-batch gradient sampling Every Feedforward Neural Network Definable in an o-Minimal Structure Has Finite Sample Complexity Adaptive auditing of AI systems with anytime-valid guarantees Locally Near Optimal Piecewise Linear Regression in High Dimensions via Difference of Max-Affine Functions Risk-Controlled Post-Processing of Decision Policies Covariate Balancing and Riesz Regression Should Be Guided by the Neyman Orthogonal Score in Debiased Machine Learning A Unified Pair-GRPO Family: From Implicit to Explicit Preference Constraints for Stable and General RL Alignment Time-Inhomogeneous Preconditioned Langevin Dynamics A Fine-Grained Understanding of Uniform Convergence for Halfspaces CITE: Anytime-Valid Statistical Inference in LLM Self-Consistency Ratio-based Loss Functions Optimal Confidence Band for Kernel Gradient Flow Estimator A renormalization-group inspired lattice-based framework for piecewise generalized linear models
Row-column factorial designs with multiple levels
Fahim Rahim, Nicholas Cavenagh · 2021-01-15 · via math.ST updates on arXiv.org

An {\em $m\times n$ row-column factorial design} is an arrangement of the elements of a factorial design into a rectangular array. Such an array is used in experimental design, where the rows and columns can act as blocking factors. If for each row/column and vector position, each element has the same regularity, then all main effects can be estimated without confounding by the row and column blocking factors. Formally, for any integer $q$, let $[q]=\{0,1,\dots ,q-1\}$. The $q^k$ (full) factorial design with replication $α$ is the multi-set consisting of $α$ occurrences of each element of $[q]^k$; we denote this by $α\times [q]^k$. A {\em regular $m\times n$ row-column factorial design} is an arrangement of the the elements of $α\times [q]^k$ into an $m\times n$ array (which we say is of {\em type} $I_k(m,n;q)$) such that for each row (column) and fixed vector position $i\in [q]$, each element of $[q]$ occurs $n/q$ times (respectively, $m/q$ times). Let $m\leq n$. We show that an array of type $I_k(m,n;q)$ exists if and only if (a) $q|m$ and $q|n$; (b) $q^k|mn$; (c) $(k,q,m,n)\neq (2,6,6,6)$ and (d) if $(k,q,m)=(2,2,2)$ then $4$ divides $n$. This extends the work of Godolphin (2019), who showed the above is true for the case $q=2$ when $m$ and $n$ are powers of $2$. In the case $k=2$, the above implies necessary and sufficient conditions for the existence of a pair of mutually orthogonal frequency rectangles (or $F$-rectangles) whenever each symbol occurs the same number of times in a given row or column.