| Towards Robust Waveform-Based Acoustic Models | 0 | 0.34 | 2022 |
| A cautionary tale on fitting decision trees to data from additive models: generalization lower bounds | 0 | 0.34 | 2022 |
| Probabilistic Grayscale Visual Cryptography Scheme Using Multi-Pixel Encoding. | 0 | 0.34 | 2021 |
| Enabling Advanced Duplex in 6G. | 0 | 0.34 | 2021 |
| Supervised line attention for tumor attribute classification from pathology reports: Higher performance with less data | 0 | 0.34 | 2021 |
| Designing Micro-intelligences for Situated Affective Computing. | 0 | 0.34 | 2021 |
| Sharp Analysis of Expectation-Maximization for Weakly Identifiable Models. | 0 | 0.34 | 2020 |
| Fast mixing of Metropolized Hamiltonian Monte Carlo: Benefits of multi-step gradients | 0 | 0.34 | 2020 |
| Veridical Data Science. | 0 | 0.34 | 2020 |
| Interpretations are useful: penalizing explanations to align neural networks with prior knowledge | 0 | 0.34 | 2020 |
| Runtime Verification of Ethereum Smart Contracts Based on MSVL. | 0 | 0.34 | 2020 |
| Unique Sharp Local Minimum in L1-minimization Complete Dictionary Learning. | 0 | 0.34 | 2020 |
| A Debiased MDI Feature Importance Measure for Random Forests. | 0 | 0.34 | 2019 |
| Disentangled Attribution Curves for Interpreting Random Forests and Boosted Trees. | 0 | 0.34 | 2019 |
| Three principles of data science: predictability, computability, and stability (PCS) | 0 | 0.34 | 2019 |
| 一种从设备零秘密存储的蓝牙密钥协商方案 (Bluetooth Key Agreement Scheme with Zero Secret Storage in Slave Device). | 0 | 0.34 | 2019 |
| Challenges with EM in application to weakly identifiable mixture models. | 0 | 0.34 | 2019 |
| Interpretable machine learning: definitions, methods, and applications. | 8 | 0.44 | 2019 |
| Unique Sharp Local Minimum in $\ell_1$-minimization Complete Dictionary Learning. | 0 | 0.34 | 2019 |
| Fast MCMC Sampling Algorithms on Polytopes. | 2 | 0.38 | 2018 |
| Beyond Word Importance: Contextual Decomposition to Extract Interactions from LSTMs. | 9 | 0.48 | 2018 |
| Stability and Convergence Trade-off of Iterative Optimization Algorithms. | 4 | 0.38 | 2018 |
| Artificial Intelligence and Statistics. | 0 | 0.34 | 2018 |
| 像素不扩展视觉密码的边缘增强研究 (Edge Enhancement on Size Invariant Visual Cryptography). | 0 | 0.34 | 2018 |
| Hierarchical interpretations for neural network predictions. | 2 | 0.36 | 2018 |
| Refining interaction search through signed iterative Random Forests. | 0 | 0.34 | 2018 |
| Vaidya walk: A sampling algorithm based on the volumetric barrier. | 0 | 0.34 | 2017 |
| Interpreting Convolutional Neural Networks Through Compression. | 2 | 0.37 | 2017 |
| Structural Compression of Convolutional Neural Networks Based on Greedy Filter Pruning. | 6 | 0.51 | 2017 |
| Three principles of data science: predictability, stability, and computability | 0 | 0.34 | 2017 |
| DataLab: a version data management and analytics system. | 0 | 0.34 | 2016 |
| Ten Simple Rules For Effective Statistical Practice | 0 | 0.34 | 2016 |
| Formulas for Counting the Sizes of Markov Equivalence Classes of Directed Acyclic Graphs. | 2 | 0.38 | 2016 |
| Do Retinal Ganglion Cells Project Natural Scenes To Their Principal Subspace And Whiten Them? | 0 | 0.34 | 2016 |
| A Novel Scattered Pilot Design for FBMC/OQAM Systems. | 0 | 0.34 | 2015 |
| Evaluation of a MISR-Based High-Resolution Aerosol Retrieval Method Using AERONET DRAGON Campaign Data | 1 | 0.38 | 2015 |
| Counting and exploring sizes of Markov equivalence classes of directed acyclic graphs. | 0 | 0.34 | 2015 |
| Early stopping and non-parametric regression: an optimal data-dependent stopping rule | 21 | 1.19 | 2014 |
| Statistical guarantees for the EM algorithm: From population to sample-based analysis | 61 | 1.98 | 2014 |
| Ontology Matching Tuning Based on Particle Swarm Optimization: Preliminary Results. | 2 | 0.46 | 2014 |
| Ontology Evolution Detection: Method and Results. | 0 | 0.34 | 2014 |
| Impact of regularization on spectral clustering | 12 | 0.62 | 2014 |
| Concise comparative summaries (CCS) of large text corpora with a human experiment. | 1 | 0.35 | 2014 |
| Error Rate Bounds in Crowdsourcing Models. | 12 | 0.63 | 2013 |
| Supervised feature selection in graphs with path coding penalties and network flows | 7 | 0.49 | 2013 |
| Improving robustness of robotic grasping by fusing multi-sensor | 5 | 0.49 | 2012 |
| Multiple-kernel learning-based unmixing algorithm for estimation of cloud fractions with MODIS and CloudSat data | 3 | 0.51 | 2012 |
| Complexity Analysis of the Lasso Regularization Path | 28 | 1.23 | 2012 |
| Reversible MCMC on Markov equivalence classes of sparse directed acyclic graphs | 4 | 0.45 | 2012 |
| Minimax-optimal rates for sparse additive models over kernel classes via convex programming | 31 | 2.41 | 2012 |
