Search Results for author: Beilun Wang

Found 12 papers, 8 papers with code

Sparse and Low-Rank High-Order Tensor Regression via Parallel Proximal Method

no code implementations29 Nov 2019 Jiaqi Zhang, Yinghao Cai, Zhaoyang Wang, Beilun Wang

Recently, tensor data (or multidimensional array) have been generated in many modern applications, such as functional magnetic resonance imaging (fMRI) in neuroscience and videos in video analysis.

Action Recognition regression +1

Fast and Scalable Estimator for Sparse and Unit-Rank Higher-Order Regression Models

no code implementations29 Nov 2019 Jiaqi Zhang, Beilun Wang

Because tensor data appear more and more frequently in various scientific researches and real-world applications, analyzing the relationship between tensor features and the univariate outcome becomes an elementary task in many fields.

regression

A Fast and Scalable Joint Estimator for Integrating Additional Knowledge in Learning Multiple Related Sparse Gaussian Graphical Models

2 code implementations ICML 2018 Beilun Wang, Arshdeep Sekhon, Yanjun Qi

We consider the problem of including additional knowledge in estimating sparse Gaussian graphical models (sGGMs) from aggregated samples, arising often in bioinformatics and neuroimaging applications.

2k Computational Efficiency +1

Fast and Scalable Learning of Sparse Changes in High-Dimensional Gaussian Graphical Model Structure

2 code implementations30 Oct 2017 Beilun Wang, Arshdeep Sekhon, Yanjun Qi

We focus on the problem of estimating the change in the dependency structures of two $p$-dimensional Gaussian Graphical models (GGMs).

A Constrained, Weighted-L1 Minimization Approach for Joint Discovery of Heterogeneous Neural Connectivity Graphs

2 code implementations arXiv 2017 Chandan Singh, Beilun Wang, Yanjun Qi

Determining functional brain connectivity is crucial to understanding the brain and neural differences underlying disorders such as autism.

Connectivity Estimation

GaKCo: a Fast GApped k-mer string Kernel using COunting

1 code implementation24 Apr 2017 Ritambhara Singh, Arshdeep Sekhon, Kamran Kowsari, Jack Lanchantin, Beilun Wang, Yanjun Qi

This is because current gk-SK uses a trie-based algorithm to calculate co-occurrence of mismatched substrings resulting in a time cost proportional to $O(\Sigma^{M})$.

DeepCloak: Masking Deep Neural Network Models for Robustness Against Adversarial Samples

no code implementations22 Feb 2017 Ji Gao, Beilun Wang, Zeming Lin, Weilin Xu, Yanjun Qi

By identifying and removing unnecessary features in a DNN model, DeepCloak limits the capacity an attacker can use generating adversarial samples and therefore increase the robustness against such inputs.

General Classification

A Fast and Scalable Joint Estimator for Learning Multiple Related Sparse Gaussian Graphical Models

2 code implementations9 Feb 2017 Beilun Wang, Ji Gao, Yanjun Qi

Estimating multiple sparse Gaussian Graphical Models (sGGMs) jointly for many related tasks (large $K$) under a high-dimensional (large $p$) situation is an important task.

Computational Efficiency

A Theoretical Framework for Robustness of (Deep) Classifiers against Adversarial Examples

no code implementations1 Dec 2016 Beilun Wang, Ji Gao, Yanjun Qi

Most machine learning classifiers, including deep neural networks, are vulnerable to adversarial examples.

Representation Learning

Deep Motif Dashboard: Visualizing and Understanding Genomic Sequences Using Deep Neural Networks

1 code implementation12 Aug 2016 Jack Lanchantin, Ritambhara Singh, Beilun Wang, Yanjun Qi

In this paper, we propose a toolkit called the Deep Motif Dashboard (DeMo Dashboard) which provides a suite of visualization strategies to extract motifs, or sequence patterns from deep neural network models for TFBS classification.

General Classification

A constrained L1 minimization approach for estimating multiple Sparse Gaussian or Nonparanormal Graphical Models

1 code implementation11 May 2016 Beilun Wang, Ritambhara Singh, Yanjun Qi

Computationally, this task can be formulated as jointly estimating multiple different, but related, sparse Undirected Graphical Models (UGM) from aggregated samples across several contexts.

Cannot find the paper you are looking for? You can Submit a new open access paper.