activity
20152018
most citedDistribution-free Junta Testing

9 citations · 21 across the 7 of their papers we have counts for

collaborators

7 papers

q-bio.GN2018

Pan-Cancer Epigenetic Biomarker Selection from Blood Samples Using SAS

Xi Chen, Jin Xie, Qingcong Yuan

A key focus in current cancer research is the discovery of cancer biomarkers that allow earlier detection with high accuracy and lower costs for both patients and hospitals. Blood…

stat.ML2018★ 1 cited

A Method to Facilitate Cancer Detection and Type Classification from Gene Expression Data using a Deep Autoencoder and Neural Network

Xi Chen, Jin Xie, Qingcong Yuan

With the increased affordability and availability of whole-genome sequencing, large-scale and high-throughput gene expression is widely used to characterize diseases, including can…

cs.CC2018★ 9 cited

Distribution-free Junta Testing

Xi Chen, Zhengyang Liu, Rocco A. Servedio +2

We study the problem of testing whether an unknown -variable Boolean function is a -junta in the distribution-free property testing model, where the distance between function…

cs.CC2017

Boolean Unateness Testing with Adaptive Queries

Xi Chen, Erik Waingarten, Jinyu Xie

We give an adaptive algorithm which tests whether an unknown Boolean function is unate, i.e. every variable of is either non-decreasing or non-…

cs.CC2017★ 1 cited

Settling the query complexity of non-adaptive junta testing

Xi Chen, Rocco A. Servedio, Li-Yang Tan +2

We prove that any non-adaptive algorithm that tests whether an unknown Boolean function is a -junta or -far from every -junta must make $\widet…

cs.CC2017★ 1 cited

Beyond Talagrand Functions: New Lower Bounds for Testing Monotonicity and Unateness

Xi Chen, Erik Waingarten, Jinyu Xie

We prove a lower bound of for the query complexity of any two-sided and adaptive algorithm that tests whether an unknown Boolean function $f:\{0,1\}^n\rightarrow…

cs.DM2015★ 9 cited

Tight Bounds for the Distribution-Free Testing of Monotone Conjunctions

Xi Chen, Jinyu Xie

We improve both upper and lower bounds for the distribution-free testing of monotone conjunctions. Given oracle access to an unknown Boolean function $f:\{0,1\}^n \rightarrow \{0,1…