Demo Data from EDBT 2026 / reviewers in the wild / expert
Abhay Venkatesh
dblp:244/9153
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2Graphics, computer vision, multimedia, augmented reality and games · 2
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 |
Learning paradigms · 46% Learning theory · 23% Deep learning architectures and training · 23% | |
| Theoretical computer science
1 paper |
Mathematical optimization · 100% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Deep learning architectures and training
activation function |
0.4 | 1 | 2020 | Generating Accurate Pseudo-Labels in Semi-Supervised Learning and Avoiding Overconfident Predictions via Hermite Polynomial Activations · CVPR 2020 |
Machine learning › Learning theory › statistical learning theory › regularization theory
data-dependent regularization |
0.4 | 1 | 2020 | Optimizing Nondecomposable Data Dependent Regularizers via Lagrangian Reparameterization Offers Significant Performance and Efficiency Gains · AAAI 2020 |
Machine learning › Learning paradigms › semi-supervised learning
pseudo-labeling |
0.4 | 1 | 2020 | Generating Accurate Pseudo-Labels in Semi-Supervised Learning and Avoiding Overconfident Predictions via Hermite Polynomial Activations · CVPR 2020 |
Machine learning › Learning paradigms
semi-supervised learning |
0.4 | 1 | 2020 | Generating Accurate Pseudo-Labels in Semi-Supervised Learning and Avoiding Overconfident Predictions via Hermite Polynomial Activations · CVPR 2020 |
Mathematical optimization › constrained optimization › duality theory
lagrangian methods |
0.4 | 1 | 2020 | Optimizing Nondecomposable Data Dependent Regularizers via Lagrangian Reparameterization Offers Significant Performance and Efficiency Gains · AAAI 2020 |
Machine learning › Trustworthy machine learning
robustness |
0.1 | 1 | 2020 | Generating Accurate Pseudo-Labels in Semi-Supervised Learning and Avoiding Overconfident Predictions via Hermite Polynomial Activations · CVPR 2020 |
Methods — techniques the papers use, named apart from their topics
lagrangian reparameterization · 0.9theoretical analysis · 0.4hermite polynomial expansion · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | Optimizing Nondecomposable Data Dependent Regularizers via Lagrangian Reparameterization Offers Significant Performance and Efficiency Gains
Sathya N. Ravi, Abhay Venkatesh, Glenn Fung |
AAAI | 2 |
| 2020 | Generating Accurate Pseudo-Labels in Semi-Supervised Learning and Avoiding Overconfident Predictions via Hermite Polynomial ActivationsabstractRectified Linear Units (ReLUs) are among the most widely used activation function in a broad variety of tasks in vision. Recent theoretical results suggest that despite their excellent practical performance, in various cases, a substitution with basis expansions (e.g., polynomials) can yield significant benefits from both the optimization and generalization perspective. Unfortunately, the existing results remain limited to networks with a couple of layers, and the practical viability of these results is not yet known. Motivated by some of these results, we explore the use of Hermite polynomial expansions as a substitute for ReLUs in deep networks. While our experiments with supervised learning do not provide a clear verdict, we find that this strategy offers considerable benefits in semi-supervised learning (SSL) / transductive learning settings. We carefully develop this idea and show how the use of Hermite polynomials based activations can yield improvements in pseudo-label accuracies and sizable financial savings (due to concurrent runtime benefits). Further, we show via theoretical analysis, that the networks (with Hermite activations) offer robustness to noise and other attractive mathematical properties. Code is available on //GitHub. Vishnu Suresh Lokhande, Songwong Tasneeyapant, Abhay Venkatesh, Sathya N. Ravi |
CVPR | 3 |