Safe Collaborative Filtering
Matroid Semi-Bandits in Sublinear Time
Regular Expressions with Backreferences and Lookaheads Capture NLOG
Optimal PSPACE-hardness of Approximating Set Cover Reconfiguration
Alphabet Reduction for Reconfiguration Problems
Computational complexity of normalizing constants for the product of determinantal point processes
Scalable and Provably Fair Exposure Control for Large-Scale Recommender Systems
Probabilistically Checkable Reconfiguration Proofs and Inapproximability of Reconfiguration Problems
On the Parameterized Intractability of Determinant Maximization
Gap Amplification for Reconfiguration Problems
Fast and Examination-agnostic Reciprocal Recommendation in Matching Markets
Toward Verifiable and Reproducible Human Evaluation for Text-to-Image Generation
Exploration of Unranked Items in Safe Online Learning to Re-Rank
Some Inapproximability Results of MAP Inference and Exponentiated Determinantal Point Processes
Curse of “Low” Dimensionality in Recommender Systems
A Critical Reexamination of Intra-List Distance and Dispersion
iMixer: invertible, implicit, and iterative MLP-Mixer from modern Hopfield networks
iMixer: hierarchical Hopfield network implies an invertible, implicit and iterative MLP-Mixer
Attention in a family of Boltzmann machines emerging from modern Hopfield networks
Gap Preserving Reductions Between Reconfiguration Problems
On Reconfigurability of Target Sets