Imagen de Portada

Recommendations with Sparse Comparison Data: Provably Fast Convergence for Nonconvex Matrix Factorization

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Sankagiri, Suryanarayana, Etesami, Jalal, Grossglauser, Matthias
Formato:	Preprint
Publicado:	2025
Materias:	Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Recycling History: Efficient Recommendations from Contextual Dueling Bandits
por: Sankagiri, Suryanarayana, et al.
Publicado: (2025)

Ranking Items from Discrete Ratings: The Cost of Unknown User Thresholds
por: Villemaud, Oscar, et al.
Publicado: (2025)

Measuring IIA Violations in Similarity Choices with Bayesian Models
por: Corrêa, Hugo Sales, et al.
Publicado: (2025)

Learning Nonlinear Factor Models with Unknown Monotone Links from Incomplete and Noisy Data
por: Chao, Yutong, et al.
Publicado: (2026)

Optimal Experiments for Partial Causal Effect Identification
por: Maringgele, Tobias, et al.
Publicado: (2026)

Online Mixture of Experts: No-Regret Learning for Optimal Collective Decision-Making
por: Liu, Larkin, et al.
Publicado: (2025)

Graph Learning Is Suboptimal in Causal Bandits
por: Shahverdikondori, Mohammad, et al.
Publicado: (2025)

Confounded Budgeted Causal Bandits
por: Jamshidi, Fateme, et al.
Publicado: (2024)

Active Context Selection Improves Simple Regret in Contextual Bandits
por: Shahverdikondori, Mohammad, et al.
Publicado: (2026)

Global Convergence to Nash Equilibrium in Nonconvex General-Sum Games under the $n$-Sided PL Condition
por: Chao, Yutong, et al.
Publicado: (2026)

Parameter identification in linear non-Gaussian causal models under general confounding
por: Tramontano, Daniele, et al.
Publicado: (2024)

Matrix Completion with Graph Information: A Provable Nonconvex Optimization Approach
por: Wang, Yao, et al.
Publicado: (2025)

Fast Proxy Experiment Design for Causal Effect Identification
por: Elahi, Sepehr, et al.
Publicado: (2024)

Pricing for Routing and Flow-Control in Payment Channel Networks
por: Sankagiri, Suryanarayana, et al.
Publicado: (2025)

The Benefits of Diversity: Combining Comparisons and Ratings for Efficient Scoring
por: Fageot, Julien, et al.
Publicado: (2026)

Provably Convergent Subgraph-wise Sampling for Fast GNN Training
por: Wang, Jie, et al.
Publicado: (2023)

Accelerating Matrix Factorization by Dynamic Pruning for Fast Recommendation
por: Wu, Yining, et al.
Publicado: (2024)

LMC: Fast Training of GNNs via Subgraph Sampling with Provable Convergence
por: Shi, Zhihao, et al.
Publicado: (2023)

Preconditioned Gradient Descent for Over-Parameterized Nonconvex Matrix Factorization
por: Zhang, Gavin, et al.
Publicado: (2025)

Faster Convergence of Local SGD for Over-Parameterized Models
por: Qin, Tiancheng, et al.
Publicado: (2022)

Hierarchical Linkage Clustering Beyond Binary Trees and Ultrametrics
por: Dreveton, Maximilien, et al.
Publicado: (2025)

Optimal Graph Clustering without Edge Density Signals
por: Dreveton, Maximilien, et al.
Publicado: (2025)

Hierarchical Reinforcement Learning with Targeted Causal Interventions
por: Khorasani, Sadegh, et al.
Publicado: (2025)

Semi-Supervised Sparse Gaussian Classification: Provable Benefits of Unlabeled Data
por: Azar, Eyar, et al.
Publicado: (2024)

On the Convergence of Adaptive Gradient Methods for Nonconvex Optimization
por: Zhou, Dongruo, et al.
Publicado: (2018)

Causal Effect Identification in a Sub-Population with Latent Variables
por: Abouei, Amir Mohammad, et al.
Publicado: (2024)

Why the Metric Backbone Preserves Community Structure
por: Dreveton, Maximilien, et al.
Publicado: (2024)

Convergence of Alternating Gradient Descent for Matrix Factorization
por: Ward, Rachel, et al.
Publicado: (2023)

Convergence and Recovery Guarantees of Unsupervised Neural Networks for Inverse Problems
por: Buskulic, Nathan, et al.
Publicado: (2023)

Provably Convergent Federated Trilevel Learning
por: Jiao, Yang, et al.
Publicado: (2023)

Constrained Stochastic Spectral Preconditioning Converges for Nonconvex Objectives
por: Oikonomidis, Konstantinos, et al.
Publicado: (2026)

Improved Convergence Rates of Muon Optimizer for Nonconvex Optimization
por: Nagashima, Shuntaro, et al.
Publicado: (2026)

Fast and Provable Nonconvex Robust Matrix Completion
por: Fu, Yichen, et al.
Publicado: (2026)

Fusing Rewards and Preferences in Reinforcement Learning
por: Khorasani, Sadegh, et al.
Publicado: (2025)

When Does Bottom-up Beat Top-down in Hierarchical Community Detection?
por: Dreveton, Maximilien, et al.
Publicado: (2023)

Provable Acceleration of Nesterov's Accelerated Gradient for Rectangular Matrix Factorization and Linear Neural Networks
por: Xu, Zhenghao, et al.
Publicado: (2024)

Nonconvex Factorization and Manifold Formulations are Almost Equivalent in Low-rank Matrix Optimization
por: Luo, Yuetian, et al.
Publicado: (2021)

Transformers Provably Learn Sparse XOR with Polylogarithmic Parameters
por: Han, Yaomengxi, et al.
Publicado: (2025)

Sharper Convergence Rates for Nonconvex Optimisation via Reduction Mappings
por: Markou, Evan, et al.
Publicado: (2025)

Learning Provably Improves the Convergence of Gradient Descent
por: Song, Qingyu, et al.
Publicado: (2025)