Hideaki Kim
11 papers · 2017–2025 · 4 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓+4 more ↓ Show less ↑
π£ Hot Topic Early Bird π Conference Polyglot Β· Bronze π Academic Marathon Β· Sprint π Interdisciplinary Bridge Β· Bronze πΊοΈ Taxonomy Completionist (27)
π
Keyword Champion
(2)
π
Century Club Β· Bronze
π₯
Unstoppable Β· Bronze
ποΈ
Keyword Collector
(57)
Venues
Top co-authors
Research topics
Keywords
gaussian process
(3)
approximation algorithm
(3)
point process
(2)
bipartite matching
(2)
combinatorial optimization
(2)
bayesian inference
(2)
permanental process
(2)
convex optimization
(2)
density estimation
(1)
representer theorem
(1)
probabilistic modeling
(1)
variational bayesian
(1)
map inference
(1)
bayesian estimation
(1)
survival analysis
(1)
sparse estimation
(1)
singular value decomposition
(1)
discrete optimization
(1)
reproducing kernel hilbert space
(1)
universal approximation
(1)
Papers
A Continuous-time Tractable Model for Present-biased Agents
AAAI 2025
K$^2$IE: Kernel Method-based Kernel Intensity Estimators for Inhomogeneous Poisson Processes
ICML 2025
Inverse M-Kernels for Linear Universal Approximators of Non-Negative Functions
NeurIPS 2024
An Improved Approximation Algorithm for Wage Determination and Online Task Allocation in Crowd-Sourcing
AAAI 2023
Survival Permanental Processes for Survival Analysis with Time-Varying Covariates
NeurIPS 2023
Fast Bayesian Estimation of Point Process Intensity as Function of Covariates
NeurIPS 2022
Online Matching with Controllable Rewards and Arrival Probabilities
IJCAI 2022
Fast Bayesian Inference for Gaussian Cox Processes via Path Integral Formulation
NeurIPS 2021
Integrated Optimization of Bipartite Matching and Its Stochastic Behavior: New Formulation and Approximation Algorithm via Min-cost Flow Optimization
AAAI 2021
Non-approximate Inference for Collective Graphical Models on Path Graphs via Discrete Difference of Convex Algorithm
NeurIPS 2021
SVD-Based Screening for the Graphical Lasso
IJCAI 2017