◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Sayan Mukherjee

Duke University

27 papers hereh-index 4352.4k citations188 works total

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

author position
  • first author3
  • middle author11
  • last author13

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

fields
  • math.ST5
  • stat.ML5
  • cs.LG4
  • stat.ME4
  • stat.AP2
  • cs.FL1
affiliations
  • Duke University
HomepageORCID 0000-0002-6715-3920
same name
  • Sayan Mukherjee — 46 papers, h 31
  • Sayan Mukherjee — 9 papers, h 11
  • Sayan Mukherjee — 3 papers, h 1
  • Sayan Mukherjee — 3 papers, h 2
  • Sayan Mukherjee — 2 papers, h 0
  • Sayan Mukherjee — 2 papers, h 1

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
20012023
most citedPredicting Clinical Outcomes in Glioblastoma: An Application of Topological and Functional Data Analysis

99 citations · 314 across the 26 of their papers we have counts for

collaborators
Showing cs.LGShow all

4 papers · 1 filter

cs.LG2022

Why Neural Networks Work

Sayandev Mukherjee, Bernardo A. Huberman

We argue that many properties of fully-connected feedforward neural networks (FCNNs), also called multi-layer perceptrons (MLPs), are explainable from the analysis of a single pair…

cs.LG2022

Concentration inequalities and optimal number of layers for stochastic deep neural networks

Michele Caprio, Sayan Mukherjee

We state concentration inequalities for the output of the hidden layers of a stochastic deep neural network (SDNN), as well as for the output of the whole SDNN. These results allow…

cs.LG2021

Tight query complexity bounds for learning graph partitions

Xizhi Liu, Sayan Mukherjee

Given a partition of a graph into connected components, the membership oracle asserts whether any two vertices of the graph lie in the same component or not. We prove that for $n\g…

cs.LG2001

Bounds on sample size for policy evaluation in Markov environments

Leonid Peshkin, Sayan Mukherjee

Reinforcement learning means finding the optimal course of action in Markovian environments without knowledge of the environment's dynamics. Stochastic optimization algorithms used…

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