arXiv Machine Learning July 2, 2026 By Theo X. Olausson, Jo\~ao Monteiro, Michal Klein, Marco Cuturi

Amortized Maximum Inner Product Search with Learned Support Functions

Read the original on arXiv Machine Learning →

arXiv:2603. 08001v3 Announce Type: replace Abstract: Maximum inner product search (MIPS) is a crucial subroutine in machine learning, requiring the identification of a vector taken within a database (the keys) that best aligns with a given query.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning

Jun 17

Amortizing Maximum Inner Product Search with Learned Support Functions

arXiv:2603. 08001v2 Announce Type: replace Abstract: Maximum inner product search (MIPS) is a crucial subroutine in machine learning, requiring the identification of a vector taken within a database (the keys) that best aligns with a given query.

By Theo X. Olausson, Jo\~ao Monteiro, Michal Klein, Marco Cuturi

rag benchmarks

arXiv Machine Learning

Jun 25

Learning Structural Hardness for Combinatorial Auctions: Instance-Dependent Algorithm Selection via Graph Neural Networks

arXiv:2602. 14772v2 Announce Type: replace Abstract: The Winner Determination Problem (WDP) in combinatorial auctions is NP-hard, and no existing method reliably predicts which instances will defeat fast greedy heuristics.

By Sungwoo Kang

benchmarks safety

arXiv AI

Aug 21

Learning Early-to-Final Solution Consistency for MILP Acceleration

arXiv:2608. 19953v1 Announce Type: new Abstract: Mixed-Integer Linear Programming (MILP) is a fundamental problem class in operations research and combinatorial optimization, with broad applications to industrial decision-making.

By Guanlin Li, Chengrui Gao, Chenguang Wang, Haopu Shang, Zherong Zhang, Ke Xue, Jixiang Lu, Weiyong Yang, Chao Qian

benchmarks

arXiv Machine Learning

Jun 25

Limitations of SGD for Multi-Index Models Beyond Statistical Queries

arXiv:2602. 05704v2 Announce Type: replace Abstract: Understanding the limitations of gradient methods, and stochastic gradient descent (SGD) in particular, is a central challenge in learning theory.

By Daniel Barzilai, Ohad Shamir

safety

arXiv Statistics ML

2d ago

IQS-BO: In-Context Query Selection for Bayesian Optimisation

arXiv:2610.01269v1 Announce Type: cross Abstract: Bayesian Optimisation (BO) is a powerful framework for the optimisation of expensive black-box functions, but typically requires refitting a surrogat...

By Luca Geminiani, Nadja Klein

llms reinforcement-learning benchmarks

arXiv Machine Learning

Jul 30

Amortized Moment Matching for Visual Generation

arXiv:2607. 26860v1 Announce Type: new Abstract: We propose amortized moment matching, utilizing neural networks to learn data moments as distributional training signals.

By Wenze Liu, Xintao Wang, Pengfei Wan, Xiangyu Yue

diffusion benchmarks

One email a morning, machine-written

Related stories

Amortizing Maximum Inner Product Search with Learned Support Functions

Learning Structural Hardness for Combinatorial Auctions: Instance-Dependent Algorithm Selection via Graph Neural Networks

Learning Early-to-Final Solution Consistency for MILP Acceleration

Limitations of SGD for Multi-Index Models Beyond Statistical Queries

IQS-BO: In-Context Query Selection for Bayesian Optimisation

Amortized Moment Matching for Visual Generation