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

Asad Haris

dblp:231/7665 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
1since 2021 · last 2022
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 2 first-author · 1 since 2021

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
1 paper
Trustworthy machine learning · 50% Learning theory · 50%
Theoretical computer science
1 paper
Mathematical optimization · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › interpretability › explainable AI
additive models
0.612022
Generalized Sparse Additive Models · J. Mach. Learn. Res. 2022
Machine learning › Learning theory
high-dimensional statistics
0.612022
Generalized Sparse Additive Models · J. Mach. Learn. Res. 2022
Mathematical optimization › statistical estimation › regression › nonparametric regression
additive models
0.312018
Wavelet regression and additive models for irregularly spaced data · NeurIPS 2018
Mathematical optimization › statistical estimation › regression
nonparametric regression
0.312018
Wavelet regression and additive models for irregularly spaced data · NeurIPS 2018

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

penalized regression · 0.6cross-validation · 0.6proximal gradient descent · 0.3minimax analysis · 0.3
YearPublicationVenuePosition
2022 Generalized Sparse Additive Models
abstract
We present a unified framework for estimation and analysis of generalized additive models in high dimensions. The framework defines a large class of penalized regression estimators, encompassing many existing methods. An efficient computational algorithm for this class is presented that easily scales to thousands of observations and features. We prove minimax optimal convergence bounds for this class under a weak compatibility condition. In addition, we characterize the rate of convergence when this compatibility condition is not met. Finally, we also show that the optimal penalty parameters for structure and sparsity penalties in our framework are linked, allowing cross-validation to be conducted over only a single tuning parameter. We complement our theoretical results with empirical studies comparing some existing methods within this framework.
Asad Haris, Noah Simon, Ali Shojaie
J. Mach. Learn. Res.1
2018 Wavelet regression and additive models for irregularly spaced data
abstract
We present a novel approach for nonparametric regression using wavelet basis functions. Our proposal, waveMesh, can be applied to non-equispaced data with sample size not necessarily a power of 2. We develop an efficient proximal gradient descent algorithm for computing the estimator and establish adaptive minimax convergence rates. The main appeal of our approach is that it naturally extends to additive and sparse additive models for a potentially large number of covariates. We prove minimax optimal convergence rates under a weak compatibility condition for sparse additive models. The compatibility condition holds when we have a small number of covariates. Additionally, we establish convergence rates for when the condition is not met. We complement our theoretical results with empirical studies comparing waveMesh to existing methods.
Asad Haris, Ali Shojaie, Noah Simon
NeurIPS1