Convergence
Convergence in machine learning is the point at which an iterative optimization algorithm reaches a stable solution, meaning the loss function stops decreasing meaningfully and further parameter updates yield…
Mathematics
Explore Mathematics through related topics and the articles other pages reference most.
Explore articles
Browse subtopics: Training & Optimization
Articles that also belong to these categories. Counts cover all of Mathematics.
All articles (82)Machine Learning (48)Statistics (14)Deep Learning (11)AI for Science (10)Training & Optimization (9)AI Research (6)Google DeepMind (5)Reinforcement Learning (5)AI Benchmarks (4)Computer Science (4)Algorithms (3)Generative AI (3)Large Language Models (3)Natural Language Processing (3)Neural Networks (3)AI Agents (2)AI Ethics (2)AI Tools & Products (2)Chinese AI (2)Developer Tools (2)Information Retrieval (2)Open Source AI (2)People (2)Programming Languages (2)AI Hardware (1)AI History (1)AI Incidents & Controversies (1)AI Infrastructure (1)AI Policy & Regulation (1)Anthropic (1)Artificial Intelligence (1)ChatGPT (1)Computer Vision (1)Data & Datasets (1)Google (1)Interpretability (1)OpenAI (1)Reasoning Models (1)Robotics (1)Software Development (1)
Showing 1-9 of 9 articles
Convex Function
A convex function is a real-valued function whose graph curves upward into a bowl or cup shape, so that the line segment (chord) connecting any two points on the graph lies on or above the graph itself.
Convex Optimization
Convex optimization is the branch of mathematical optimization that minimizes a convex function over a convex set, a problem class with one defining advantage: every local minimum is also a global minimum.
Convex Set
A convex set is a set of points in which the line segment connecting any two points of the set lies entirely within the set .
Distributionally Robust Optimization
Distributionally robust optimization (DRO) is a framework for making decisions when the probability distribution of uncertain inputs is not known exactly.
Gradient
In machine learning, the gradient is the vector of partial derivatives of a loss function with respect to every model parameter, and it points in the direction in which the loss increases most steeply.
Log Loss
Log loss is the negative log-likelihood of the predicted probabilities and the standard loss function for probabilistic classification: for binary labels it is computed as…
Minimax Loss
Minimax loss is a loss function rooted in game theory and decision theory that measures the worst-case performance of a strategy, algorithm, or model.
Wasserstein Loss
Wasserstein loss is a loss function for training generative models that measures the distance between two probability distributions as the Wasserstein-1 distance