◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Yuichi Yoshida

75 papers hereh-index 328.8k citations157 works total

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

author position
  • sole author11
  • first author2
  • middle author6
  • last author56

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

fields
  • cs.DS51
  • cs.LG7
  • math.CO4
  • cs.CL3
  • stat.ML3
  • cs.CC2
same name
  • Yuichi Yoshida — 10 papers, h 1
  • Yuichi Yoshida — 9 papers, h 5
  • Yuichi Yoshida — 2 papers, 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
20102026
most citedSpectral Normalization for Generative Adversarial Networks

3.4k citations · 3.9k across the 67 of their papers we have counts for

collaborators
Showing 2016 · cs.DSShow all

4 papers · 2 filters

cs.DS2016

A Characterization of Constant-Sample Testable Properties

Eric Blais, Yuichi Yoshida

We characterize the set of properties of Boolean-valued functions on a finite domain X that are testable with a constant number of samples. Specifically, we show that a…

cs.DS2016★ 7 cited

Non-monotone DR-Submodular Function Maximization

Tasuku Soma, Yuichi Yoshida

We consider non-monotone DR-submodular function maximization, where DR-submodularity (diminishing return submodularity) is an extension of submodularity for functions over the inte…

cs.DS2016

Testing Assignments to Constraint Satisfaction Problems

Hubie Chen, Matt Valeriote, Yuichi Yoshida

For a finite relational structure A, let CSP(A) denote the CSP instances whose constraint relations are taken from A. The resulting family of problems CSP(A) has been considered he…

cs.DS2016★ 5 cited

Maximizing a Monotone Submodular Function with a Bounded Curvature under a Knapsack Constraint

Yuichi Yoshida

We consider the problem of maximizing a monotone submodular function under a knapsack constraint. We show that, for any fixed ε>0, there exists a polynomial-time algorithm with…

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