← Search

Yuya Hikima

6 accepted papers

2025

Guided Zeroth-Order Methods for Stochastic Non-convex Problems with Decision-Dependent Distributions

ICML 2025poster

In this study, we tackle an optimization problem with a known function and an unknown decision-dependent distribution, which arises in a variety of applications and is often referred to as a performative prediction problem. To solve the problem, several zeroth-order methods have been developed becau…

Cited by 0SourcePDFScholar
2025

Natural Perturbations for Black-box Training of Neural Networks by Zeroth-Order Optimization

ICML 2025poster

This paper proposes a novel concept of natural perturbations for black-box training of neural networks by zeroth-order optimization. When a neural network is implemented directly in hardware, training its parameters by backpropagation ends up with an inaccurate result due to the lack of detailed int…

Cited by 0SourcePDFScholar
2025

Zeroth-Order Methods for Nonconvex Stochastic Problems with Decision-Dependent Distributions

AAAI 2025technical

In this study, we consider an optimization problem with uncertainty dependent on decision variables, which has recently attracted attention due to its importance in machine learning and pricing applications. In this problem, the gradient of the objective function cannot be obtained explicitly becaus…

2023

An Improved Approximation Algorithm for Wage Determination and Online Task Allocation in Crowd-Sourcing

AAAI 2023technical

Crowd-sourcing has attracted much attention due to its growing importance to society, and numerous studies have been conducted on task allocation and wage determination. Recent works have focused on optimizing task allocation and workers' wages, simultaneously. However, existing methods do not provi…

Cited by 4SourcePDFScholar
2022

Online Matching with Controllable Rewards and Arrival Probabilities

IJCAI 2022poster

Online bipartite matching has attracted much attention due to its importance in various applications such as advertising, ride-sharing, and crowdsourcing. In most online matching problems, the rewards and node arrival probabilities are given in advance and are not controllable. However, many real-wo…

2021

Integrated Optimization of Bipartite Matching and Its Stochastic Behavior: New Formulation and Approximation Algorithm via Min-cost Flow Optimization

AAAI 2021technical

The research field of stochastic matching has yielded many developments for various applications. In most stochastic matching problems, the probability distributions inherent in the nodes and edges are set a priori, and are not controllable. However, many matching services have options, which we cal…

Cited by 9SourcePDFScholar