◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Aarti Singh

6 papers hereh-index 6245 citations11 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • middle author5

Across the 5 of 6 papers where every author was matched, so the position is known.

fields
  • cs.LG4
  • stat.ML2
same name
  • Aarti Singh — 19 papers, h 18
  • Aarti Singh — 12 papers, h 14
  • Aarti Singh — 11 papers, h 8
  • Aarti Singh — 8 papers, h 8
  • Aarti Singh — 7 papers, h 7
  • Aarti Singh — 7 papers, h 5

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20172020
most citedActive Learning for Graph Neural Networks via Node Feature Propagation

28 citations · 46 across the 6 of their papers we have counts for

collaborators
Showing cs.LGShow all

4 papers · 1 filter

cs.LG2020★ 7 cited

Preference-based Reinforcement Learning with Finite-Time Guarantees

Yichong Xu, Ruosong Wang, Lin F. Yang +2

Preference-based Reinforcement Learning (PbRL) replaces reward values in traditional reinforcement learning by preferences to better elicit human opinion on the target objective, e…

cs.LG2019★ 3 cited

Zeroth Order Non-convex optimization with Dueling-Choice Bandits

Yichong Xu, Aparna Joshi, Aarti Singh +1

We consider a novel setting of zeroth order non-convex optimization, where in addition to querying the function value at a given point, we can also duel two points and get the poin…

cs.LG2019★ 28 cited

Active Learning for Graph Neural Networks via Node Feature Propagation

Yuexin Wu, Yichong Xu, Aarti Singh +2

Graph Neural Networks (GNNs) for prediction tasks like node classification or edge prediction have received increasing attention in recent machine learning from graphically structu…

cs.LG2019★ 2 cited

Thresholding Bandit Problem with Both Duels and Pulls

Yichong Xu, Xi Chen, Aarti Singh +1

The Thresholding Bandit Problem (TBP) aims to find the set of arms with mean rewards greater than a given threshold. We consider a new setting of TBP, where in addition to pulling…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.