Copertina

Multiple Greedy Quasi-Newton Methods for Saddle Point Problems

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Xiao, Minheng, Wu, Zhizhong
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Artificial Intelligence
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Root Cause Attribution of Delivery Risks via Causal Discovery with Reinforcement Learning
di: Xiao, Minheng
Pubblicazione: (2024)

Adaptive Friction in Deep Learning: Enhancing Optimizers with Sigmoid and Tanh Function
di: Zheng, Hongye, et al.
Pubblicazione: (2024)

Policy Gradient Methods for Risk-Sensitive Distributional Reinforcement Learning with Provable Convergence
di: Xiao, Minheng, et al.
Pubblicazione: (2024)

Quasi-Quadratic Gradient: A New Direction for Accelerating the BFGS Method in Quasi-Newton Optimization
di: Chiang, John
Pubblicazione: (2026)

Saddle-To-Saddle Dynamics in Deep ReLU Networks: Low-Rank Bias in the First Saddle Escape
di: Bantzis, Ioannis, et al.
Pubblicazione: (2025)

An Efficient Recommendation Model Based on Knowledge Graph Attention-Assisted Network (KGATAX)
di: Wu, Zhizhong
Pubblicazione: (2024)

Research on Travel Route Planing Problems Based on Greedy Algorithm
di: Wang, Yiquan
Pubblicazione: (2024)

Bilevel Optimization over Saddle Points of Zero-Sum Markov Games
di: Zheng, Zihao, et al.
Pubblicazione: (2026)

A Learn-to-Optimize Approach for Coordinate-Wise Step Sizes for Quasi-Newton Methods
di: Lin, Wei, et al.
Pubblicazione: (2024)

Fast Stochastic Greedy Algorithm for $k$-Submodular Cover Problem
di: Nguyen, Hue T., et al.
Pubblicazione: (2025)

Dimer-Enhanced Optimization: A First-Order Approach to Escaping Saddle Points in Neural Network Training
di: Hu, Yue, et al.
Pubblicazione: (2025)

Greedy and Transformer-Based Multi-Port Selection for Slow Fluid Antenna Multiple Access
di: Perez-Adan, Darian, et al.
Pubblicazione: (2026)

On Newton's Method to Unlearn Neural Networks
di: Bui, Nhung, et al.
Pubblicazione: (2024)

Greedy Sampling Is Provably Efficient for RLHF
di: Wu, Di, et al.
Pubblicazione: (2025)

Greedy Restart Schedules: A Baseline for Dynamic Algorithm Selection on Numerical Black-box Optimization Problems
di: Schäpermeier, Lennart
Pubblicazione: (2025)

Greedy-DiM: Greedy Algorithms for Unreasonably Effective Face Morphs
di: Blasingame, Zander W., et al.
Pubblicazione: (2024)

Information-Theoretic Greedy Layer-wise Training for Traffic Sign Recognition
di: Lyu, Shuyan, et al.
Pubblicazione: (2025)

Greedy Is Enough: Sparse Action Discovery in Agentic LLMs
di: Majumdar, Angshul
Pubblicazione: (2026)

Less Greedy Equivalence Search
di: Ejaz, Adiba, et al.
Pubblicazione: (2025)

Greedy Is a Strong Default: Agents as Iterative Optimizers
di: Li, Yitao
Pubblicazione: (2026)

Spectral Greedy Coresets for Graph Neural Networks
di: Ding, Mucong, et al.
Pubblicazione: (2024)

Greedy Algorithm for Inference of Decision Trees from Decision Rule Systems
di: Durdymyradov, Kerven, et al.
Pubblicazione: (2024)

Credible Plan-Driven RAG Method for Multi-Hop Question Answering
di: Zhang, Ningning, et al.
Pubblicazione: (2025)

Greedy Output Approximation: Towards Efficient Structured Pruning for LLMs Without Retraining
di: Li, Jianwei, et al.
Pubblicazione: (2024)

Annealed Softmax Greedy in Many-Armed Bayesian Bandits
di: Overman, William, et al.
Pubblicazione: (2026)

CAMO: A Conditional Neural Solver for the Multi-objective Multiple Traveling Salesman Problem
di: Li, Fengxiaoxiao, et al.
Pubblicazione: (2026)

How Well Can Transformers Emulate In-context Newton's Method?
di: Giannou, Angeliki, et al.
Pubblicazione: (2024)

SibylSat: Using SAT as an Oracle to Perform a Greedy Search on TOHTN Planning
di: Quenard, Gaspard, et al.
Pubblicazione: (2024)

Refined Iterated Pareto Greedy for Energy-aware Hybrid Flowshop Scheduling with Blocking Constraints
di: Missaoui, Ahmed, et al.
Pubblicazione: (2025)

On Solving the Multiple Variable Gapped Longest Common Subsequence Problem
di: Djukanović, Marko, et al.
Pubblicazione: (2026)

Evaluating LLMs with Multiple Problems at once
di: Wang, Zhengxiang, et al.
Pubblicazione: (2024)

Proximal Point Method for Online Saddle Point Problem
di: Meng, Qing-xin, et al.
Pubblicazione: (2024)

Greedy SLIM: A SLIM-Based Approach For Preference Elicitation
di: Proissl, Claudius, et al.
Pubblicazione: (2024)

Generalizable Object Re-Identification via Visual In-Context Prompting
di: Huang, Zhizhong, et al.
Pubblicazione: (2025)

Properties of Fixed Points of Generalised Extra Gradient Methods Applied to Min-Max Problems
di: Farzin, Amir Ali, et al.
Pubblicazione: (2025)

Solving the Min-Max Multiple Traveling Salesmen Problem via Learning-Based Path Generation and Optimal Splitting
di: Wang, Wen, et al.
Pubblicazione: (2025)

Greedy Perspectives: Multi-Drone View Planning for Collaborative Perception in Cluttered Environments
di: Suresh, Krishna, et al.
Pubblicazione: (2023)

Research on target detection method of distracted driving behavior based on improved YOLOv8
di: Shen, Shiquan, et al.
Pubblicazione: (2024)

Collaboration! Towards Robust Neural Methods for Routing Problems
di: Zhou, Jianan, et al.
Pubblicazione: (2024)

Learning Cross-Atlas Consistent Brain Disorder Representations via Disentangled Multi-Atlas Functional Connectivity Learning
di: Chen, Minheng, et al.
Pubblicazione: (2026)