Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Rei Higuchi

dblp:127/0727 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
4since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 3 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Language models and text generation · 50% Deep learning architectures and training · 50%
Theoretical computer science
2 papers
Mathematical optimization · 50% Automated reasoning and model checking · 50%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

Topics — the 10 heaviest of 11, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation
alignment
0.912025
Direct Density Ratio Optimization: A Statistically Consistent Approach to Aligning Large Language Models · ICML 2025
Machine learning › Deep learning architectures and training
attention mechanism
0.912025
Degrees of Freedom for Linear Attention: Distilling Softmax Attention with Optimal Feature Efficiency · NeurIPS 2025
Machine learning › Deep learning architectures and training › attention mechanism › efficient attention
linear attention
0.912025
Degrees of Freedom for Linear Attention: Distilling Softmax Attention with Optimal Feature Efficiency · NeurIPS 2025
Natural language and speech › Language models and text generation
preference optimization
0.912025
Direct Density Ratio Optimization: A Statistically Consistent Approach to Aligning Large Language Models · ICML 2025
Bioinformatics and computational biology › network bioinformatics
biological network analysis
0.912025
A SAT-based Method for Counting All Singleton Attractors in Boolean Networks · IJCAI 2025
Bioinformatics and computational biology › network bioinformatics › boolean network
boolean network attractors
0.912025
A SAT-based Method for Counting All Singleton Attractors in Boolean Networks · IJCAI 2025
Mathematical optimization
nonconvex optimization
0.912025
Improving Convergence Guarantees of Random Subspace Second-order Algorithm for Nonconvex Optimization · ICLR 2025
Automated reasoning and model checking › satisfiability
SAT-based constraint solving
0.912025
A SAT-based Method for Counting All Singleton Attractors in Boolean Networks · IJCAI 2025
Automated reasoning and model checking
satisfiability
0.912025
A SAT-based Method for Counting All Singleton Attractors in Boolean Networks · IJCAI 2025
Mathematical optimization › numerical computation › numerical optimization › second-order methods
trust region methods
0.912025
Improving Convergence Guarantees of Random Subspace Second-order Algorithm for Nonconvex Optimization · ICLR 2025

Methods — techniques the papers use, named apart from their topics

SAT solving · 1.7statistical consistency analysis · 0.9random subspace method · 0.9layer-wise training · 0.9homogenized trust region · 0.9density ratio estimation · 0.9degrees of freedom · 0.9
YearPublicationVenuePosition
2025 Improving Convergence Guarantees of Random Subspace Second-order Algorithm for Nonconvex Optimization
abstract
In recent years, random subspace methods have been actively studied for large-dimensional nonconvex problems. Recent subspace methods have improved theoretical guarantees such as iteration complexity and local convergence rate while reducing computational costs by deriving descent directions in randomly selected low-dimensional subspaces. This paper proposes the Random Subspace Homogenized Trust Region (RSHTR) method with the best theoretical guarantees among random subspace algorithms for nonconvex optimization. RSHTR achieves an $\varepsilon$-approximate first-order stationary point in $O(\varepsilon^{-3/2})$ iterations, converging locally at a linear rate. Furthermore, under rank-deficient conditions, RSHTR satisfies $\varepsilon$-approximate second-order necessary conditions in $O(\varepsilon^{-3/2})$ iterations and exhibits a local quadratic convergence. Experiments on real-world datasets verify the benefits of RSHTR.
Rei Higuchi, Pierre-Louis Poirion, Akiko Takeda
ICLR1
2025 Direct Density Ratio Optimization: A Statistically Consistent Approach to Aligning Large Language Models
abstract
Aligning large language models (LLMs) with human preferences is crucial for safe deployment, yet existing methods assume specific preference models like Bradley-Terry model. This assumption leads to statistical inconsistency, where more data doesn’t guarantee convergence to true human preferences. To address this critical gap, we introduce a novel alignment method Direct Density Ratio Optimization (DDRO). DDRO directly estimates the density ratio between preferred and unpreferred output distributions, circumventing the need for explicit human preference modeling. We theoretically prove that DDRO is statistically consistent, ensuring convergence to the true preferred distribution as the data size grows, regardless of the underlying preference structure. Experiments demonstrate that DDRO achieves superior performance compared to existing methods, showcasing its effectiveness and potential for significant improvement. DDRO unlocks the potential for truly data-driven alignment, paving the way for more reliable and human-aligned LLMs.
Rei Higuchi, Taiji Suzuki
ICML1
2025 A SAT-based Method for Counting All Singleton Attractors in Boolean Networks
abstract
Boolean networks (BNs) are widely used to model biological regulatory networks. Attractors here hold significant meaning as they represent long-term behaviors such as homeostasis and the results of cell differentiation. As such, computing attractors is of critical importance to guarantee the validity of a model or to assess its stability and robustness. However, this problem is quite challenging when it comes to large real-world models. To overcome the limits of state-of-the-art BDD-based or ASP-based enumeration approaches, we introduce a SAT-based approach to compute fixed points (singleton attractors) of BN and exhibit its merits for counting the number of singleton attractors of large-scale benchmarks well established in the literature.
Rei Higuchi, Takehide Soh, Daniel Le Berre, Morgan Magnin, Mutsunori Banbara, Naoyuki Tamura
IJCAI1
2025 Degrees of Freedom for Linear Attention: Distilling Softmax Attention with Optimal Feature Efficiency
abstract
Linear attention has attracted interest as a computationally efficient approximation to softmax attention, especially for long sequences. Recent studies has explored distilling softmax attention in pre-trained Transformers into linear attention. However, a critical challenge remains: *how to choose the feature dimension that governs the approximation quality*. Existing methods fix this dimension uniformly across all attention layers, overlooking the diverse roles and complexities of them. In this paper, we propose a principled method to automatically determine the feature dimension in linear attention using the concept of statistical *degrees of freedom*, which represent the effective dimensionality of the inputs. We provide a theoretical bound on the approximation error and show that the dimension chosen by our method achieves smaller errors under a fixed computational budget. Furthermore, we introduce an efficient layerwise training strategy to learn nonlinear features tailored to each layer. Experiments on multiple pre-trained transformers demonstrate that our method improves the performance of distilled models compared to baselines without increasing the inference cost. Our findings also provide insight into how the complexity of the attention mechanism evolves across layers.
Naoki Nishikawa, Rei Higuchi, Taiji Suzuki
NeurIPS2
2006 Thermal Analysis of Joule Heat Generated on Metal Thin Film by Microwave Irradiation
abstract
The microwave heating of the catalyst coated with nickel thin film was modeled and calculated. The theory was established by using Maxwell equation and so on. The result corresponded with experimental one. The theory also shows the relationship between the film thickness and the microwave power absorbed.
Rei Higuchi, Hideaki Takashima, Hatsuhiro Kato, Yoshinori Kanno
SMC1