Yuichi Yoshida
21 papers · 2013–2023 · 8 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+12 more ↓ Show less ↑
π£ Hot Topic Early Bird π Interdisciplinary Bridge πΊοΈ Taxonomy Completionist (10) π§ Keyword Pioneer π Conference Polyglot (8)
π£
Hot Topic Early Bird
π
Cross-Pollinator
(6)
π
Renaissance Researcher
(8)
π
Triple Crown
π
Grand Slam
π§¬
Topic Evolution
π
Keyword Champion
(2)
π
Conference Pioneer
π
Trend Setter
ποΈ
Keyword Collector
(88)
π₯
Unstoppable
(9)
π
Century Club
(21)
Conferences
NIPS (7)
IJCAI (4)
AISTATS (3)
ICLR (2)
ICML (2)
AAAI (1)
EACL (1)
UAI (1)
Top co-authors
Research topics
Keywords
approximation algorithm
(4)
submodular optimization
(3)
combinatorial optimization
(2)
constant time algorithm
(2)
regret bound
(2)
submodular maximization
(2)
matroid constraint
(2)
submodular function
(2)
online algorithm
(2)
k-submodular function
(2)
variational inference
(1)
gradient descent
(1)
gaussian process regression
(1)
random sampling
(1)
random walk
(1)
online learning
(1)
low-rank approximation
(1)
kernel regression
(1)
tensor decomposition
(1)
link prediction
(1)
Papers
A Batch-to-Online Transformation under Random-Order Model
NIPS 2023
Controlling Posterior Collapse by an Inverse Lipschitz Constraint on the Decoder Network
ICML 2023
Average Sensitivity of Decision Tree Learning
ICLR 2023
Average Sensitivity of Euclidean k-Clustering
NIPS 2022
Sparsification of Decomposable Submodular Functions
AAAI 2022
RelWalk - A Latent Variable Model Approach to Knowledge Graph Embedding
EACL 2021
Online Risk-Averse Submodular Maximization
IJCAI 2021
Tight First- and Second-Order Regret Bounds for Adversarial Linear Bandits
NIPS 2020
Fast and Private Submodular and $k$-Submodular Functions Maximization with Matroid Constraints
ICML 2020
On Random Subsampling of Gaussian Process Regression: A Graphon-Based Analysis
AISTATS 2020
Variational Inference of Penalized Regression with Submodular Functions
UAI 2019
Guaranteed Sufficient Decrease for Stochastic Variance Reduced Gradient Optimization
AISTATS 2018
Spectral Normalization for Generative Adversarial Networks
ICLR 2018
Statistically Efficient Estimation for Non-Smooth Probability Densities
AISTATS 2018
Computational Aspects of the Preference Cores of Supermodular Two-Scenario Cooperative Games
IJCAI 2018
Fitting Low-Rank Tensors in Constant Time
NIPS 2017
Minimizing Quadratic Functions in Constant Time
NIPS 2016
Efficient Algorithms for Spanning Tree Centrality
IJCAI 2016
A Generalization of Submodular Cover via the Diminishing Return Property on the Integer Lattice
NIPS 2015
Monotone k-Submodular Function Maximization with Size Constraints
NIPS 2015
Mining for Analogous Tuples from an Entity-Relation Graph
IJCAI 2013