← Search

Rei Higuchi

5 accepted papers

2026

Inference-Aware Meta-Alignment of LLMs via Non-Linear GRPO

ICML 2026poster

Aligning large language models (LLMs) to diverse human preferences is fundamentally challenging since criteria can often conflict with each other. Inference-time alignment methods have recently gained popularity as they allow LLMs to be aligned to multiple criteria via different alignment algorithms…

Cited by 0SourceScholar
2025

A SAT-based Method for Counting All Singleton Attractors in Boolean Networks

IJCAI 2025

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 validit

2025

Degrees of Freedom for Linear Attention: Distilling Softmax Attention with Optimal Feature Efficiency

NeurIPS 2025poster

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…

Cited by 0SourceScholar
2025

Direct Density Ratio Optimization: A Statistically Consistent Approach to Aligning Large Language Models

ICML 2025poster

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. T…

Cited by 0SourcePDFScholar
2025

Improving Convergence Guarantees of Random Subspace Second-order Algorithm for Nonconvex Optimization

ICLR 2025spotlight

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 rand…

Cited by 0SourcePDFScholar