Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Arshdeep Sekhon

dblp:199/2383 · DBLP profile ↗
← Back
10ranked-venue papers
3as first author
4since 2021 · last 2023
0000-0001-5289-3320ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 9 · 2 first-author · 4 since 2021Databases, data management, data science and information retrieval · 2Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Trustworthy machine learning · 28% Probabilistic and Bayesian machine learning · 28% Learning theory · 28%
Interdisciplinary, comprehensive, and emerging computing
2 papers
Bioinformatics and computational biology · 100%

Topics — the 12 heaviest of 13, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning
interpretability
0.712023
Improving Interpretability via Explicit Word Interaction Graph Layer · AAAI 2023
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models
gaussian graphical model
0.312018
A Fast and Scalable Joint Estimator for Integrating Additional Knowledge in Learning Multiple Related Sparse Gaussian Graphical Models · ICML 2018
Machine learning › Probabilistic and Bayesian machine learning › structured models
graphical models
0.312018
A Fast and Scalable Joint Estimator for Integrating Additional Knowledge in Learning Multiple Related Sparse Gaussian Graphical Models · ICML 2018
Machine learning › Learning theory › high-dimensional statistics
sparse estimation
0.312018
A Fast and Scalable Joint Estimator for Integrating Additional Knowledge in Learning Multiple Related Sparse Gaussian Graphical Models · ICML 2018
Bioinformatics and computational biology › gene expression analysis
differential expression analysis
0.312018
DeepDiff: DEEP-learning for predicting DIFFerential gene expression from histone modifications · Bioinform. 2018
Bioinformatics and computational biology
gene expression analysis
0.312018
DeepDiff: DEEP-learning for predicting DIFFerential gene expression from histone modifications · Bioinform. 2018
Bioinformatics and computational biology › epigenomics
histone modification analysis
0.312018
DeepDiff: DEEP-learning for predicting DIFFerential gene expression from histone modifications · Bioinform. 2018
Bioinformatics and computational biology › gene expression analysis
gene expression prediction
0.312017
Attend and Predict: Understanding Gene Regulation by Selective Attention on Chromatin · NIPS 2017
Bioinformatics and computational biology
gene regulation
0.312017
Attend and Predict: Understanding Gene Regulation by Selective Attention on Chromatin · NIPS 2017
Natural language and speech › Information extraction and text analysis › text classification
interpretable text classification
0.212023
Improving Interpretability via Explicit Word Interaction Graph Layer · AAAI 2023
Natural language and speech › Information extraction and text analysis
text classification
0.212023
Improving Interpretability via Explicit Word Interaction Graph Layer · AAAI 2023
Bioinformatics and computational biology
epigenomics
0.112018
DeepDiff: DEEP-learning for predicting DIFFerential gene expression from histone modifications · Bioinform. 2018

Methods — techniques the papers use, named apart from their topics

graph neural network · 0.7attention mechanism · 0.7attention · 0.6LSTM · 0.6proximal gradient · 0.3parallel computation · 0.3multi-task learning · 0.3hybrid norm regularization · 0.3deep learning · 0.3
YearPublicationVenuePosition
2023 Improving Interpretability via Explicit Word Interaction Graph Layer
abstract
Recent NLP literature has seen growing interest in improving model interpretability. Along this direction, we propose a trainable neural network layer that learns a global interaction graph between words and then selects more informative words using the learned word interactions. Our layer, we call WIGRAPH, can plug into any neural network-based NLP text classifiers right after its word embedding layer. Across multiple SOTA NLP models and various NLP datasets, we demonstrate that adding the WIGRAPH layer substantially improves NLP models' interpretability and enhances models' prediction performance at the same time.
Arshdeep Sekhon, Aman Shrivastava, Zhe Wang 0025, Yangfeng Ji, Yanjun Qi
AAAI1
2022 Beyond Data Samples: Aligning Differential Networks Estimation with Scientific Knowledge
abstract
Learning the differential statistical dependency network between two contexts is essential for many real-life applications, mostly in the high dimensional low sample regime. In this paper, we propose a novel differential network estimator that allows integrating various sources of knowledge beyond data samples. The proposed estimator is scalable to a large number of variables and achieves a sharp asymptotic convergence rate. Empirical experiments on extensive simulated data and four real-world applications (one on neuroimaging and three from functional genomics) show that our approach achieves improved differential network estimation and provides better supports to downstream tasks like classification. Our results highlight significant benefits of integrating group, spatial and anatomic knowledge during differential genetic network identification and brain connectome change discovery.
Arshdeep Sekhon, Zhe Wang 0025, Yanjun Qi
AISTATS1
2022 ST-MAML : A stochastic-task based method for task-heterogeneous meta-learning
abstract
Optimization-based meta-learning typically assumes tasks are sampled from a single distribution - an assumption that oversimplifies and limits the diversity of tasks that meta-learning can model. Handling tasks from multiple distributions is challenging for meta-learning because it adds ambiguity to task identities. This paper proposes a novel method, ST-MAML, that empowers model-agnostic meta-learning (MAML) to learn from multiple task distributions. ST-MAML encodes tasks using a stochastic neural network module, that summarizes every task with a stochastic representation. The proposed Stochastic Task (ST) strategy learns a distribution of solutions for an ambiguous task and allows a meta-model to self-adapt to the current task. ST-MAML also propagates the task representation to enhance input variable encodings. Empirically, we demonstrate that ST-MAML outperforms the state-of-the-art on two few-shot image classification tasks, one curve regression benchmark, one image completion problem, and a real-world temperature prediction application.
Zhe Wang 0025, Jake Grigsby, Arshdeep Sekhon, Yanjun Qi
UAI3
2021 Evolving Image Compositions for Feature Representation Learning
Paola Cascante-Bonilla, Arshdeep Sekhon, Yanjun Qi, Vicente Ordonez
BMVC2
2019 Neural Message Passing for Multi-label Classification
Jack Lanchantin, Arshdeep Sekhon, Yanjun Qi
ECML/PKDD (2)2
2018 Fast and Scalable Learning of Sparse Changes in High-Dimensional Gaussian Graphical Model Structure
abstract
We focus on the problem of estimating the change in the dependency structures of two $p$-dimensional Gaussian Graphical models (GGMs). Previous studies for sparse change estimation in GGMs involve expensive and difficult non-smooth optimization. We propose a novel method, DIFFEE for estimating DIFFerential networks via an Elementary Estimator under a high-dimensional situation. DIFFEE is solved through a faster and closed form solution that enables it to work in large-scale settings. We conduct a rigorous statistical analysis showing that surprisingly DIFFEE achieves the same asymptotic convergence rates as the state-of-the-art estimators that are much more difficult to compute. Our experimental results on multiple synthetic datasets and one real-world data about brain connectivity show strong performance improvements over baselines, as well as significant computational benefits.
Beilun Wang, Arshdeep Sekhon, Yanjun Qi
AISTATS2
2018 A Fast and Scalable Joint Estimator for Integrating Additional Knowledge in Learning Multiple Related Sparse Gaussian Graphical Models
abstract
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. Previous joint sGGM estimators either fail to use existing knowledge or cannot scale-up to many tasks (large $K$) under a high-dimensional (large $p$) situation. In this paper, we propose a novel \underline{J}oint \underline{E}lementary \underline{E}stimator incorporating additional \underline{K}nowledge (JEEK) to infer multiple related sparse Gaussian Graphical models from large-scale heterogeneous data. Using domain knowledge as weights, we design a novel hybrid norm as the minimization objective to enforce the superposition of two weighted sparsity constraints, one on the shared interactions and the other on the task-specific structural patterns. This enables JEEK to elegantly consider various forms of existing knowledge based on the domain at hand and avoid the need to design knowledge-specific optimization. JEEK is solved through a fast and entry-wise parallelizable solution that largely improves the computational efficiency of the state-of-the-art $O(p^5K^4)$ to $O(p^2K^4)$. We conduct a rigorous statistical analysis showing that JEEK achieves the same convergence rate $O(\log(Kp)/n_{tot})$ as the state-of-the-art estimators that are much harder to compute. Empirically, on multiple synthetic datasets and one real-world data from neuroscience, JEEP outperforms the speed of the state-of-arts significantly while achieving the same level of prediction accuracy.
Beilun Wang, Arshdeep Sekhon, Yanjun Qi
ICML2
2018 DeepDiff: DEEP-learning for predicting DIFFerential gene expression from histone modifications
abstract
Motivation: Computational methods that predict differential gene expression from histone modification signals are highly desirable for understanding how histone modifications control the functional heterogeneity of cells through influencing differential gene regulation. Recent studies either failed to capture combinatorial effects on differential prediction or primarily only focused on cell type-specific analysis. In this paper we develop a novel attention-based deep learning architecture, DeepDiff, that provides a unified and end-to-end solution to model and to interpret how dependencies among histone modifications control the differential patterns of gene regulation. DeepDiff uses a hierarchy of multiple Long Short-Term Memory (LSTM) modules to encode the spatial structure of input signals and to model how various histone modifications cooperate automatically. We introduce and train two levels of attention jointly with the target prediction, enabling DeepDiff to attend differentially to relevant modifications and to locate important genome positions for each modification. Additionally, DeepDiff introduces a novel deep-learning based multi-task formulation to use the cell-type-specific gene expression predictions as auxiliary tasks, encouraging richer feature embeddings in our primary task of differential expression prediction. Results: Using data from Roadmap Epigenomics Project (REMC) for ten different pairs of cell types, we show that DeepDiff significantly outperforms the state-of-the-art baselines for differential gene expression prediction. The learned attention weights are validated by observations from previous studies about how epigenetic mechanisms connect to differential gene expression. Availability and implementation: Codes and results are available at deepchrome.org. Supplementary information: Supplementary data are available at Bioinformatics online.
Arshdeep Sekhon, Ritambhara Singh, Yanjun Qi
Bioinform.1
2017 Attend and Predict: Understanding Gene Regulation by Selective Attention on Chromatin
abstract
The past decade has seen a revolution in genomic technologies that enabled a flood of genome-wide profiling of chromatin marks. Recent literature tried to understand gene regulation by predicting gene expression from large-scale chromatin measurements. Two fundamental challenges exist for such learning tasks: (1) genome-wide chromatin signals are spatially structured, high-dimensional and highly modular; and (2) the core aim is to understand what are the relevant factors and how they work together. Previous studies either failed to model complex dependencies among input signals or relied on separate feature analysis to explain the decisions. This paper presents an attention-based deep learning approach; AttentiveChrome, that uses a unified architecture to model and to interpret dependencies among chromatin factors for controlling gene regulation. AttentiveChrome uses a hierarchy of multiple Long Short-Term Memory (LSTM) modules to encode the input signals and to model how various chromatin marks cooperate automatically. AttentiveChrome trains two levels of attention jointly with the target prediction, enabling it to attend differentially to relevant marks and to locate important positions per mark. We evaluate the model across 56 different cell types (tasks) in human. Not only is the proposed architecture more accurate, but its attention scores also provide a better interpretation than state-of-the-art feature visualization methods such as saliency map.
Ritambhara Singh, Jack Lanchantin, Arshdeep Sekhon, Yanjun Qi
NIPS3
2017 GaKCo: A Fast Gapped k-mer String Kernel Using Counting
Ritambhara Singh, Arshdeep Sekhon, Kamran Kowsari, Jack Lanchantin, Beilun Wang, Yanjun Qi
ECML/PKDD (1)2