🔥The 9th Round of Easy Loan, Earn $40 Reward is in progress❗️ ⏰ Promotion Period: January 15th - Feburary 15th, 2025 👉 Register now and check more details at gate.io/campaigns/358

The first half of #MLSS2024 is over! It was filled with great lectures, a wonderful location at OIST , and lots of interaction with new and old friends!

Just wrapped up #MLSS2024 last Friday after two incredible weeks, already feeling nostalgic! Enjoyed my first face-to-face MLSS experience and honored to contribute as one of program committee members. Huge thanks to OIST's teams, excellent speakers, and all participants!

Tokyo🇯🇵 HND→ Rome🇮🇹 FCO✈️ 少しだけ桜🌸見れた✨

Heading to Singapore for The Web Conference! Proud to present our paper "Local Centrality Minimization with Quality Guarantees" and looking forward to meeting everyone at the conference! dl.acm.org/doi/10.1145/35…

Giving a keynote about Algorithmic Fairness today at The 5th ACM Summer School on #DataScience in #Athens

Our paper, "Dynamic Structure Estimation from Bandit Feedback using Nonvanishing Exponential Sums," by *Motoya Ohnishi, *Isao Ishikawa (*co-first), YK, and Masahiro Ikeda, has been accepted in Transactions on Machine Learning Research! 🔗: openreview.net/pdf?id=xNkASJL…

Our paper 'Query-Efficient Correlation Clustering with Noisy Oracle,' has been accepted at #NeurIPS2024! Sincere thanks to my co-authors Atsushi Miyauchi Francesco Bonchi (CENTAI (Center for AI)) and Wei Chen (Microsoft Research )! 🔗arxiv.org/pdf/2402.01400 (will be updated soon!)

NeurIPS2024に主著論文がAcceptされました!🥂 類似度の情報が未知な場合の相関クラスタリングに対し, 最適腕識別問題としての定式化と近似精度およびクエリ数の上界保証付きアルゴリズム提案しました． (プレプリント：arxiv.org/pdf/2402.01400, 近日更新予定)

We have uploaded our NeurIPS paper on online correlation clustering! 🔗📃: arxiv.org/abs/2402.01400 🔗Slides: drive.google.com/file/d/12Vg4Jf… See you in Vancouver🇨🇦!

I am happy to chat with anyone interested in clustering with uncertainty! In today’s 11:00-14:00 at NeurIPS West Ballroom 6004

Excited to share our new Densest Subgraph paper, accepted at #WSDM2025! 🎉 We propose a novel method to find subgraphs in social networks that are dense and share aligned opinions on multiple topics. Great collaboration with Tianyi Chen and Babis Tsourakakis! arxiv.org/abs/2412.11647

WSDM 2025 で発表予定の密グラフ抽出論文を公開しました 🎉 頂点が意見をもつソーシャルネットワークにおいて，密でありかつ整合した意見をもつ部分グラフを抽出するための方法論を提案しました．Celonis の Tianyi Chen，RelationalAI の Babis Tsourakakis との共著です！ arxiv.org/abs/2412.11647

Microsoft Research congratulates Wei Chen and Ben Zorn on being named 2024 ACM Fellows—Wei for contributions to network influence maximization and combinatorial online learning, and Ben for contributions to programming language systems. msft.it/6019UK0Cv

IBIS2025のホームページを公開しました。 ・日時：2025年11月12日（水） ～ 15日（土） ・会場：那覇文化芸術劇場なはーと ぜひ予定の確保をお願いします！ ibisml.org/ibis2025/

Our #ICML2025 paper is now on arXiv! We present the first practical asymptotic (1 - 1/e)-approximation algorithm for multiobjective submodular maximization and introduce a new application fair centrality maximization. Kudos to Fabian for taking the lead! arxiv.org/abs/2505.09525

AIの使い方には、社会的な立場の違いがはっきりと現れているとの調査報告。 たとえば、収入が高く教育歴のある人たちは、AIを仕事や学習の効率化のために活用する傾向があります。

Honored to be selected as one of the Top Reviewers for #ICML2025 and to receive a complimentary registration! Not just because of that, I'll be attending to present our paper on multiobjective submodular maximization. See you in Vancouver! 🇨🇦