◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

A. Tan

4 papers hereh-index 3271 citations6 works total

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

author position
  • middle author1
  • last author3

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

fields
  • cs.NE2
  • cs.CC1
  • cs.LG1
same name
  • A. Tan — 43 papers, h 23
  • A. Tan — 8 papers, h 7
  • A. Tan — 4 papers, h 42
  • A. Tan — 3 papers, h 3
  • A. Tan — 3 papers, h 18
  • A. Tan — 3 papers, h 12

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

most citedAI Feynman 2.0: Pareto-optimal symbolic regression exploiting graph modularity

85 citations · 93 across the 4 of their papers we have counts for

collaborators

4 papers

cs.NE2021★ 6 cited

A nonlinear hidden layer enables actor-critic agents to learn multiple paired association navigation

M Ganesh Kumar, Cheston Tan, Camilo Libedinsky +2

Navigation to multiple cued reward locations has been increasingly used to study rodent learning. Though deep reinforcement learning agents have been shown to be able to learn the…

cs.NE2021★ 2 cited

One-shot learning of paired association navigation with biologically plausible schemas

M Ganesh Kumar, Cheston Tan, Camilo Libedinsky +2

After learning a multiple paired-association (MPA) navigation task, rodents can rapidly learn new cue-location associations after a single exposure, a phenomenon proposed to be fac…

cs.LG2020★ 85 cited

AI Feynman 2.0: Pareto-optimal symbolic regression exploiting graph modularity

Silviu-Marian Udrescu, Andrew Tan, Jiahai Feng +3

We present an improved method for symbolic regression that seeks to fit data to formulas that are Pareto-optimal, in the sense of having the best accuracy for a given complexity. I…

cs.CC2020

Approximating Boolean Functions with Disjunctive Normal Form

Yunhao Yang, Andrew Tan

The theorem states that: Every Boolean function can be ε−approximated by a Disjunctive Normal Form (DNF) of size Oε​(2n/logn). This paper will demonstrate this theorem in…

◍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.