TARCO corrects measurement-error-induced correlated contamination in tree-aggregated compositional regression via bias-corrected estimating equations, tree-aware PSD stabilization, and sparse regularization, with finite-sample bounds and sign consistency.
Journal of classification , volume=
5 Pith papers cite this work. Polarity classification is still indexing.
years
2026 5verdicts
UNVERDICTED 5representative citing papers
AssayBench is a new gene-ranking benchmark for phenotypic CRISPR screens that shows zero-shot generalist LLMs outperform both biology-specific LLMs and trainable baselines on adjusted nDCG.
Participatory provenance auditing of Canada's AI strategy consultation shows official AI summaries exclude 15-17% of participants more than random baselines, with 33-88% exclusion for dissent clusters.
GAME is a convex estimator using overlapping nuclear-norm penalties on subgroup submatrices for low-rank matrix completion with known overlapping groups, providing finite-sample guarantees on reconstruction error and subgroup subspace recovery.
DKPS-based methods leverage cached model responses to achieve equivalent benchmark prediction accuracy with substantially fewer queries than standard evaluation.
citing papers explorer
-
Tree-aggregated regression for compositional data with measurement errors
TARCO corrects measurement-error-induced correlated contamination in tree-aggregated compositional regression via bias-corrected estimating equations, tree-aware PSD stabilization, and sparse regularization, with finite-sample bounds and sign consistency.
-
AssayBench: An Assay-Level Virtual Cell Benchmark for LLMs and Agents
AssayBench is a new gene-ranking benchmark for phenotypic CRISPR screens that shows zero-shot generalist LLMs outperform both biology-specific LLMs and trainable baselines on adjusted nDCG.
-
Participatory provenance as representational auditing for AI-mediated public consultation
Participatory provenance auditing of Canada's AI strategy consultation shows official AI summaries exclude 15-17% of participants more than random baselines, with 33-88% exclusion for dissent clusters.
-
Group-Aware Matrix Estimation and Latent Subspace Recovery
GAME is a convex estimator using overlapping nuclear-norm penalties on subgroup submatrices for low-rank matrix completion with known overlapping groups, providing finite-sample guarantees on reconstruction error and subgroup subspace recovery.
-
Query-efficient model evaluation using cached responses
DKPS-based methods leverage cached model responses to achieve equivalent benchmark prediction accuracy with substantially fewer queries than standard evaluation.