◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Rahul Mehta

5 papers hereh-index 372 citations15 works total

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

author position
  • sole author4
  • first author1

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

fields
  • cs.DS2
  • cs.CC1
  • cs.LG1
  • stat.ML1
same name
  • Rahul Mehta — 3 papers, h 3
  • Rahul Mehta — 1 paper, h 4

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
20132020
most citedSparse Transfer Learning via Winning Lottery Tickets

19 citations · 28 across the 4 of their papers we have counts for

collaborators

5 papers

stat.ML2020

Correlated Mixed Membership Modeling of Somatic Mutations

Rahul Mehta, Muge Karaman

Recent studies of cancer somatic mutation profiles seek to identify mutations for targeted therapy in personalized medicine. Analysis of profiles, however, is not trivial, as each…

cs.LG2019★ 19 cited

Sparse Transfer Learning via Winning Lottery Tickets

Rahul Mehta

The recently proposed Lottery Ticket Hypothesis of Frankle and Carbin (2019) suggests that the performance of over-parameterized deep networks is due to the random initialization s…

cs.CC2014★ 9 cited

2048 is (PSPACE) Hard, but Sometimes Easy

Rahul Mehta

We prove that a variant of 2048, a popular online puzzle game, is PSPACE-Complete. Our hardness result holds for a version of the problem where the player has oracle access to the…

cs.DS2013

Max-Flows on Sparse and Dense Networks

Rahul Mehta

In this paper, we present an improved algorithm for the maximum flow problem on general networks with n vertices and m arcs. We show how to solve the problem in O(mn) time, w…

cs.DS2013

A New Push-Relabel Algorithm for Sparse Networks

Rahul Mehta

In this paper, we present a new push-relabel algorithm for the maximum flow problem on flow networks with n vertices and m arcs. Our algorithm computes a maximum flow in $O(mn)…

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