A Fully Parameter-Free Second-Order Algorithm for Convex-Concave Minimax Problems with Optimal Iteration Complexity.
Junlin WangJunnan YangZi XuPublished in: CoRR (2024)
Keyphrases
- worst case
- parameter free
- dynamic programming
- computational complexity
- learning algorithm
- optimal solution
- np hard
- convex concave
- objective function
- similarity measure
- k means
- data mining
- solution path
- np hardness
- clustering method
- categorical data
- sensitivity analysis
- saddle point
- global minimum
- piecewise linear
- convex hull
- detection algorithm
- expectation maximization
- linear programming
- support vector
- data streams