On the public citation graph
On Nonconvex Optimization for Machine Learning
0 signed · 92 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-1-4757-3216-0_17openalex-snapshot
Squared Functional Systems and Optimization Problems
inferredcites →https://doi.org/10.1007/s10107-018-1255-7openalex-snapshot
Partitioning a graph into small pieces with applications to path transversal
inferredcites →https://doi.org/10.1016/0041-5553(63)90382-3openalex-snapshot
Gradient methods for the minimisation of functionals
inferredcites →https://doi.org/10.1109/isit.2016.7541725openalex-snapshot
A geometric analysis of phase retrieval
inferredcites →https://doi.org/10.1109/tit.2016.2632162openalex-snapshot
Complete Dictionary Recovery Over the Sphere I: Overview and the Geometric Picture
inferredcites →https://doi.org/10.1137/120880811openalex-snapshot
Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
inferredcites →https://doi.org/10.1137/17m1113898openalex-snapshot
Gradient Descent Finds the Cubic-Regularized Nonconvex Newton Step
inferredcites →https://doi.org/10.1137/17m1114296openalex-snapshot
Accelerated Methods for NonConvex Optimization
inferredcites →https://doi.org/10.1145/2488608.2488693openalex-snapshot
Low-rank matrix completion using alternating minimization
inferredcites →https://doi.org/10.1145/3055399.3055464openalex-snapshot
Finding approximate local minima faster than gradient descent
inferredcites →https://doi.org/10.2307/3318418openalex-snapshot
Exponential Convergence of Langevin Distributions and Their Discrete Approximations
inferredcites →https://doi.org/10.3929/ethz-b-000282738openalex-snapshot
CoCoA: A General Framework for Communication-Efficient Distributed Optimization
inferredcites →https://doi.org/10.4171/jems/14openalex-snapshot
Metastability in Reversible Diffusion Processes I: Sharp Asymptotics for Capacities and Exit Times
inferredcites →https://doi.org/10.48550/arxiv.1605.07221openalex-snapshot
Global Optimality of Local Search for Low Rank Matrix Recovery
inferredcites →https://doi.org/10.48550/arxiv.1605.07272openalex-snapshot
Matrix Completion has No Spurious Local Minimum
inferredcites →https://doi.org/10.48550/arxiv.1606.04970openalex-snapshot
The non-convex Burer-Monteiro approach works on smooth semidefinite programs
inferredcites →https://doi.org/10.48550/arxiv.1711.02838openalex-snapshot
Stochastic Cubic Regularization for Fast Nonconvex Optimization
inferredcites →https://doi.org/10.48550/arxiv.1711.06673openalex-snapshot
Neon2: Finding Local Minima via First-Order Oracles
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpa.22197openalex-snapshot
The threshold energy of low temperature Langevin dynamics for pure spherical spin glasses
inferred← citeshttps://doi.org/10.1007/978-3-031-00832-0_3openalex-snapshot
Recent Theoretical Advances in Non-Convex Optimization
inferred← citeshttps://doi.org/10.1007/978-3-031-22543-7_10openalex-snapshot
Some Adaptive First-Order Methods for Variational Inequalities with Relatively Strongly Monotone Operators and Generalized Smoothness
inferred← citeshttps://doi.org/10.1007/978-3-031-37966-6_9openalex-snapshot
Quantum Annealing for Real-World Machine Learning Applications
inferred← citeshttps://doi.org/10.1007/978-3-031-40837-3_13openalex-snapshot
The Split Matters: Flat Minima Methods for Improving the Performance of GNNs
inferred← citeshttps://doi.org/10.1007/978-3-032-11153-1_17openalex-snapshot
Quantum Error Correction and Detection for Quantum Machine Learning
inferred← citeshttps://doi.org/10.1007/978-3-032-29532-3_17openalex-snapshot
Evaluating Noisy Optimization in Finetuning LMs for Neural Ranking
inferred← citeshttps://doi.org/10.1007/978-981-97-2253-2_20openalex-snapshot
RPH-PGD: Randomly Projected Hessian for Perturbed Gradient Descent
inferred← citeshttps://doi.org/10.1007/s00521-026-12014-1openalex-snapshot
First-order optimization algorithms: state of the art, classification, and performance: a practitioner’s guide
inferred← citeshttps://doi.org/10.1007/s10107-023-02031-6openalex-snapshot
No dimension-free deterministic algorithm computes approximate stationarities of Lipschitzians
inferred← citeshttps://doi.org/10.1007/s10463-024-00906-9openalex-snapshot
Minimizing robust density power-based divergences for general parametric density models
inferred← citeshttps://doi.org/10.1007/s10957-025-02817-yopenalex-snapshot
A Randomized Algorithm for Nonconvex Minimization With Inexact Evaluations and Complexity Guarantees
inferred← citeshttps://doi.org/10.1007/s11067-025-09698-8openalex-snapshot
Transformation of Bi-level Transit Network Design Problem into Single-objective Unconstrained Optimization
inferred← citeshttps://doi.org/10.1007/s42979-021-00751-0openalex-snapshot
A Review of Machine Learning Classification Using Quantum Annealing for Real-World Applications
inferred← citeshttps://doi.org/10.1016/j.asoc.2025.113453openalex-snapshot
A neural network based on back-propagation and cooperative co-evolution
inferred← citeshttps://doi.org/10.1016/j.automatica.2023.110858openalex-snapshot
Decentralized nonconvex optimization with guaranteed privacy and accuracy
inferred← citeshttps://doi.org/10.1016/j.cad.2023.103668openalex-snapshot
The deep neural network solver for B-spline approximation
inferred← citeshttps://doi.org/10.1016/j.compchemeng.2022.108123openalex-snapshot
Efficient learning of decision-making models: A penalty block coordinate descent algorithm for data-driven inverse optimization
inferred← citeshttps://doi.org/10.1016/j.engappai.2025.112149openalex-snapshot
Transforming physics-informed machine learning to convex optimization
inferred← citeshttps://doi.org/10.1016/j.exco.2023.100123openalex-snapshot
Counterexamples for Noise Models of Stochastic Gradients
inferred← citeshttps://doi.org/10.1016/j.jcmds.2024.100090openalex-snapshot
Escaping saddle points efficiently with occupation-time-adapted perturbations
inferred← citeshttps://doi.org/10.1016/j.jisa.2025.104095openalex-snapshot
QL-PGD: An efficient defense against membership inference attack
inferred← citeshttps://doi.org/10.1017/apr.2026.10056openalex-snapshot
Non-asymptotic analysis of online noisy stochastic gradient descent
inferred← citeshttps://doi.org/10.1038/s41467-021-27374-6openalex-snapshot
Mini-batch optimization enables training of ODE models on large-scale datasets
inferred← citeshttps://doi.org/10.1038/s43586-022-00125-7openalex-snapshot
Piecewise linear neural networks and deep learning
inferred← citeshttps://doi.org/10.1063/5.0161876openalex-snapshot
Gradient-descent-like scheme for the Allen–Cahn equation
inferred← citeshttps://doi.org/10.1080/10485252.2026.2638780openalex-snapshot
Kolmogorov–Smirnov learning by neural networks with a nonconvex surrogate loss
inferred← citeshttps://doi.org/10.1088/1742-5468/ad3194openalex-snapshot
A gentle introduction to gradient-based optimization and variational inequalities for machine learning
inferred← citeshttps://doi.org/10.1088/1742-5468/ade2ebopenalex-snapshot
Only strict saddles in the energy landscape of predictive coding networks? *
inferred← citeshttps://doi.org/10.1088/2058-9565/ae2157openalex-snapshot
Almost fault-tolerant quantum machine learning with drastic overhead reduction
inferred← citeshttps://doi.org/10.1090/mcom/3994openalex-snapshot
Properties of discrete sliced Wasserstein losses
inferred← citeshttps://doi.org/10.1103/gg2j-xtk6openalex-snapshot
Mitigating Barren Plateaus in Quantum Denoising Diffusion Probabilistic Model
inferred← citeshttps://doi.org/10.1103/physrevresearch.6.033029openalex-snapshot
Random coordinate descent: A simple alternative for optimizing parameterized quantum circuits
inferred← citeshttps://doi.org/10.1103/prxquantum.4.010325openalex-snapshot
Compressive Gate Set Tomography
inferred← citeshttps://doi.org/10.1109/asyu67174.2025.11208367openalex-snapshot
Dynamic Enzyme Action Optimizer (dEAO): An Adaptive Bio-Inspired Approach for Classical Benchmark Functions
inferred← citeshttps://doi.org/10.1109/cdc56724.2024.10886614openalex-snapshot
Equilibrium Seeking in Learning-Based Noncooperative Nash Games
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00086openalex-snapshot
Memory-Query Tradeoffs for Randomized Convex Optimization
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00022openalex-snapshot
Locally Stationary Distributions: A Framework for Analyzing Slow-Mixing Markov Chains*
inferred← citeshttps://doi.org/10.1109/isit57864.2024.10619481openalex-snapshot
DIST-CURE: A Robust Distributed Learning Algorithm with Cubic Regularized Newton
inferred← citeshttps://doi.org/10.1109/jiot.2023.3340014openalex-snapshot
Accelerated Federated Learning Over Wireless Fading Channels With Adaptive Stochastic Momentum
inferred← citeshttps://doi.org/10.1109/mlccim55934.2022.00084openalex-snapshot
Distributed Optimization and Sampling with Constraints from Machine Learning
inferred← citeshttps://doi.org/10.1109/tac.2021.3111853openalex-snapshot
Distributed Gradient Flow: Nonsmoothness, Nonconvexity, and Saddle Point Evasion
inferred← citeshttps://doi.org/10.1109/tac.2023.3341752openalex-snapshot
Model-Free Nonlinear Feedback Optimization
inferred← citeshttps://doi.org/10.1109/tifs.2025.3550808openalex-snapshot
Differentially Private Linearized ADMM Algorithm for Decentralized Nonconvex Optimization
inferred← citeshttps://doi.org/10.1109/tii.2022.3195701openalex-snapshot
Optimal Charging Control of Energy Storage Systems for Pulse Power Load Using Deep Reinforcement Learning in Shipboard Integrated Power Systems
inferred← citeshttps://doi.org/10.1109/tmc.2025.3573600openalex-snapshot
Communication-Efficient Multi-Server Federated Learning via Over-the-Air Computation
inferred← citeshttps://doi.org/10.1109/tnnls.2024.3411020openalex-snapshot
Bypassing Stationary Points in Training Deep Learning Models
inferred← citeshttps://doi.org/10.1109/tnnls.2025.3574683openalex-snapshot
A Dynamics Theory of RMSProp-Based Implicit Regularization in Deep Low-Rank Matrix Factorization
inferred← citeshttps://doi.org/10.1109/tpami.2024.3394552openalex-snapshot
Searching to Exploit Memorization Effect in Deep Learning With Noisy Labels
inferred← citeshttps://doi.org/10.1109/twc.2026.3707448openalex-snapshot
Communication-Efficient Over-the-Air Federated Learning via Lightweight Gradient Compression
inferred← citeshttps://doi.org/10.1137/20m1383835openalex-snapshot
Adaptive Hamiltonian Variational Integrators and Applications to Symplectic Accelerated Optimization
inferred← citeshttps://doi.org/10.1137/21m1430868openalex-snapshot
Escaping Strict Saddle Points of the Moreau Envelope in Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1137/21m1460375openalex-snapshot
On the Global Convergence of Randomized Coordinate Gradient Descent for Nonconvex Optimization
inferred← citeshttps://doi.org/10.1137/24m1697980openalex-snapshot
Sharp Global Guarantees for Nonconvex Low-Rank Recovery in the Noisy Overparameterized Regime
inferred← citeshttps://doi.org/10.1145/3406325.3451052openalex-snapshot
The complexity of gradient descent: CLS = PPAD ∩ PLS
inferred← citeshttps://doi.org/10.1145/3568163openalex-snapshot
The Complexity of Gradient Descent: CLS = PPAD ∩ PLS
inferred← citeshttps://doi.org/10.1145/3653781.3653813openalex-snapshot
A Bregman Inertial Relaxed Forward-Backward Method for Nonconvex Minimization Problems
inferred← citeshttps://doi.org/10.1145/3798129.3800767openalex-snapshot
The Complexity of Min-Max Optimization with Product Constraints
inferred← citeshttps://doi.org/10.1155/jama/9703233openalex-snapshot
A Geometric‐Nonlinear Optimization Algorithm for Solving Pose Matrices in Aircraft Visual Navigation
inferred← citeshttps://doi.org/10.1214/23-ejp1066openalex-snapshot
Optimizing mean field spin glasses with external field
inferred← citeshttps://doi.org/10.1561/2400000047openalex-snapshot
Gradient-Based Algorithms for Zeroth-Order Optimization
inferred← citeshttps://doi.org/10.18409/ispiv.v1i1.90openalex-snapshot
Approximate Bayesian framework for 3D reconstruction in a volumetric PIV/PTV measurement
inferred← citeshttps://doi.org/10.22331/q-2021-08-20-529openalex-snapshot
Quantum algorithms for escaping from saddle points
inferred← citeshttps://doi.org/10.22331/q-2023-06-02-1030openalex-snapshot
On Quantum Speedups for Nonconvex Optimization via Quantum Tunneling Walks
inferred← citeshttps://doi.org/10.3390/biomimetics10110787openalex-snapshot
FBCA: Flexible Besiege and Conquer Algorithm for Multi-Layer Perceptron Optimization Problems
inferred← citeshttps://doi.org/10.3390/diagnostics13010076openalex-snapshot
Early Diagnosis of COVID-19 Images Using Optimal CNN Hyperparameters
inferred← citeshttps://doi.org/10.3390/s23187793openalex-snapshot
Spectral Efficiency Improvement Using Bi-Deep Learning Model for IRS-Assisted MU-MISO Communication System
inferred← citeshttps://doi.org/10.3934/era.2026329openalex-snapshot
A dynamic self‑adaptive optimization framework integrating the metaheuristic strategy for the non‑convex stochastic optimization problem
inferred← citeshttps://doi.org/10.48550/arxiv.2012.14415openalex-snapshot
Stochastic Approximation for Online Tensorial Independent Component Analysis
inferred← citeshttps://doi.org/10.48550/arxiv.2105.02375openalex-snapshot
A Geometric Analysis of Neural Collapse with Unconstrained Features
inferred← citeshttps://doi.org/10.48550/arxiv.2105.10090openalex-snapshot
Escaping Saddle Points with Compressed SGD
inferred← citeshttps://doi.org/10.48550/arxiv.2111.07126openalex-snapshot
On the Statistical Benefits of Curriculum Learning
inferred← citeshttps://doi.org/10.70675/efd1c35czdc85z40bdzb5d3zd973c7dde220openalex-snapshot
Supervised learning in binary dynamical physical systems through energy minimization
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.