18 citations · 47 across the 5 of their papers we have counts for
5 papers
Towards Practical Explainability with Cluster Descriptors
Xiaoyuan Liu, Ilya Tyagin, Hayato Ushijima-Mwesigwa +2
With the rapid development of machine learning, improving its explainability has become a crucial research goal. We study the problem of making the clusters more explainable by inv…
Partitioning Dense Graphs with Hardware Accelerators
Xiaoyuan Liu, Hayato Ushijima-Mwesigwa, Indradeep Ghosh +1
Graph partitioning is a fundamental combinatorial optimization problem that attracts a lot of attention from theoreticians and practitioners due to its broad applications. From mul…
Effective electromagnetic actions for Lorentz violating theories exhibiting the axial anomaly
A. Gómez, A. Martín-Ruiz, L. F. Urrutia
The CPT odd contribution to the effective electromagnetic action deriving from the vacuum polarization tensor in a large class of fermionic systems exhibiting Lorentz invariance vi…
Ising-Based Louvain Method: Clustering Large Graphs with Specialized Hardware
Pouya Rezazadeh Kalehbasti, Hayato Ushijima-Mwesigwa, Avradip Mandal +1
Recent advances in specialized hardware for solving optimization problems such quantum computers, quantum annealers, and CMOS annealers give rise to new ways for solving real-word…
Binary matrix factorization on special purpose hardware
Osman Asif Malik, Hayato Ushijima-Mwesigwa, Arnab Roy +2
Many fundamental problems in data mining can be reduced to one or more NP-hard combinatorial optimization problems. Recent advances in novel technologies such as quantum and quantu…