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

Hariharan Manikandan

dblp:290/7152 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
4since 2021 · last 2023
0000-0002-9382-568XORCID · verified

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

Artificial intelligence and machine learning · 3 · 2 first-author · 3 since 2021Systems, architecture and hardware · 1 · 1 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
Language models and text generation · 33% Kernel, tree and ensemble methods · 33% Learning theory · 33%

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

TopicWeightPapersLastEvidence papers
Machine learning › Kernel, tree and ensemble methods › ensemble learning
boosting
0.712023
Language Models are Weak Learners · NeurIPS 2023
Machine learning › Learning theory › PAC learning
weak learner
0.712023
Language Models are Weak Learners · NeurIPS 2023

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

prompt-based learning · 0.7few-shot learning · 0.7boosting · 0.7
YearPublicationVenuePosition
2023 Language Models are Weak Learners
abstract
A central notion in practical and theoretical machine learning is that of a *weak learner*, classifiers that achieve better-than-random performance (on any given distribution over data), even by a small margin. Such weak learners form the practical basis for canonical machine learning methods such as boosting. In this work, we illustrate that prompt-based large language models can operate effectively as said weak learners. Specifically, we illustrate the use of a large language model (LLM) as a weak learner in a boosting algorithm applied to tabular data. We show that by providing (properly sampled according to the distribution of interest) text descriptions of tabular data samples, LLMs can produce a summary of the samples that serves as a template for classification, and achieves the aim of acting as a weak learner on this task. We incorporate these models into a boosting approach, which in many settings can leverage the knowledge within the LLM to outperform traditional tree-based boosting. The model outperforms both few-shot learning and occasionally even more involved fine-tuning procedures, particularly for some tasks involving small numbers of data points. The results illustrate the potential for prompt-based LLMs to function not just as few-shot learners themselves, but as components of larger machine learning models.
Hariharan Manikandan, Yiding Jiang, J. Zico Kolter
NeurIPS1
2023 Detecting log anomaly using subword attention encoder and probabilistic feature selection
Hariharan Manikandan, Abhinesh Mishra, Sriram Ravi, Anshul Tanwar, Krishna Sundaresan, Prasanna Ganesan, R. Karthik 0001
Appl. Intell.1
2022 Proximal Instance Aggregator networks for explainable security vulnerability detection
Hariharan Manikandan, Sathish Kumar Chandrasekaran, Anshul Tanwar, Krishna Sundaresan, Prasanna Ganesan, Sriram Ravi, R. Karthik 0001
Future Gener. Comput. Syst.1
2022 Contour-enhanced attention CNN for CT-based COVID-19 segmentation
R. Karthik 0001, Menaka R 0001, Hariharan Manikandan, Daehan Won
Pattern Recognit.3