← Search

Atsushi Miyauchi

7 accepted papers

2026

Online Minimization of Polarization and Disagreement via Low-Rank Matrix Bandits

ICLR 2026poster

We study the problem of minimizing polarization and disagreement in the Friedkin–Johnsen opinion dynamics model under incomplete information. Unlike prior work that assumes a static setting with full knowledge of users' innate opinions, we address the more realistic online setting where innate opini…

Cited by 0SourcecodeScholar
2025

An Asymptotically Optimal Approximation Algorithm for Multiobjective Submodular Maximization at Scale

ICML 2025poster

Maximizing a single submodular set function subject to a cardinality constraint is a well-studied and central topic in combinatorial optimization. However, finding a set that maximizes multiple functions at the same time is much less understood, even though it is a formulation which naturally occurs…

Cited by 0SourcePDFScholar
2025

Minimizing Polarization and Disagreement in the Friedkin–Johnsen Model with Unknown Innate Opinions

IJCAI 2025

The bulk of the literature on opinion optimization in social networks adopts the Friedkin–Johnsen (FJ) opinion dynamics model, in which the innate opinions of all nodes are known: this is an unrealistic assumption. In this paper, we study opinion optimization under the FJ model without the full know

2024

Bandits with Abstention under Expert Advice

NeurIPS 2024poster

We study the classic problem of prediction with expert advice under bandit feedback. Our model assumes that one action, corresponding to the learner's abstention from play, has no reward or loss on every trial. We propose the CBA (Confidence-rated Bandits with Abstentions) algorithm, which exploits…

2024

Query-Efficient Correlation Clustering with Noisy Oracle

NeurIPS 2024poster

We study a general clustering setting in which we have $n$ elements to be clustered, and we aim to perform as few queries as possible to an oracle that returns a noisy sample of the weighted similarity between two elements. Our setting encompasses many application domains in which the similarity fun…

Cited by 2SourcePDFScholar
2020

Online Dense Subgraph Discovery via Blurred-Graph Feedback

ICML 2020poster

Dense subgraph discovery aims to find a dense component in edge-weighted graphs. This is a fundamental graph-mining task with a variety of applications and thus has received much attention recently. Although most existing methods assume that each individual edge weight is easily obtained, such an as…

Cited by 17SourcePDFScholar
2015

Threshold Influence Model for Allocating Advertising Budgets

ICML 2015poster

We propose a new influence model for allocating budgets to advertising channels. Our model captures customer’s sensitivity to advertisements as a threshold behavior; a customer is expected to be influenced if the influence he receives exceeds his threshold. Over the threshold model, we discuss two o…

Cited by 23SourcePDFScholar