Related Experiment Video
Updated: Aug 5, 2026

03:14
Augmenting Large Language Models via Vector Embeddings to Improve Domain-Specific Responsiveness
Published on: December 6, 2024
Miles: Metric Learning With Expandable Subspace for Pre-Trained Model-Based Class-Incremental Learning
Summary
MetrIc Learning with Expandable Subspace (Miles) efficiently adapts pre-trained models for Class Incremental Learning (CIL). This method balances performance and computational cost by guided parameter expansion, avoiding catastrophic forgetting.
Area of Science:
- Artificial Intelligence
- Machine Learning
- Computer Vision
Background:
- Class Incremental Learning (CIL) aims to learn new data sequentially without forgetting past knowledge.
- Pre-trained models (PTMs) offer efficient task adaptation but existing CIL methods struggle with performance-cost trade-offs.
- Current PTM-based CIL methods either cause catastrophic forgetting or increase computational load via task-specific branches.
Purpose of the Study:
- To propose an efficient PTM-based Class Incremental Learning method that balances performance and computational expenditure.
- To introduce a novel approach for parameter space expansion guided by prior knowledge.
- To address the limitations of existing CIL methods in adapting PTMs.
Main Methods:
- MetrIc Learning with Expandable Subspace (Miles) leverages prior information from PTMs for guided parameter space expansion.
- Decouples learnable modules from the PTM backbone, utilizing intermediate features for flexible parameter growth.
- Employs a central loss for clustering new categories towards prototypes and a regularization term for metric equilibrium.
Main Results:
- Miles achieves state-of-the-art performance across various Class Incremental Learning scenarios.
- Demonstrates superior results in balancing learning new concepts with preserving old knowledge.
- Validates effectiveness on six benchmark datasets, showcasing significant improvements over existing methods.
Conclusions:
- Miles offers an effective solution for Class Incremental Learning using pre-trained models.
- The proposed method successfully navigates the trade-off between performance and computational efficiency.
- Miles provides a flexible and powerful framework for continual learning applications.
Related Concept Videos
Linearization and Approximation
Linearization is a mathematical technique used to approximate complex, nonlinear functions with simpler linear models in the vicinity of a chosen reference point. The method is based on the idea that, although a function may be difficult to evaluate exactly, its behavior near a specific input value can often be closely approximated by the tangent line at that point. This approach is particularly useful when small deviations from a known value are involved.Consider the square root function, for...
Linear Approximations
For a differentiable function of two variables, linear approximation estimates values near a known point by replacing the curved surface with its tangent plane. Consider the function\begin{equation*}f(x,y)=x^2+3y^2\end{equation*}near the point (2, 1). The exact value at this point is f(2, 1) = 22 + 3(1)2 = 4 + 3 = 7.The linear approximation of f(x, y)) near (a, b) is\begin{equation*}L(x,y)=f(a,b)+f_x(a,b)(x-a)+f_y(a,b)(y-b)\end{equation*}First, compute the partial derivatives: fx(x, y) = 2x and...
Distance Problem
When an object's velocity changes over time, the total distance traveled can be determined by summing small displacement intervals over short increments. This approach approximates the true distance through numerical summation and the use of integral calculus. An estimate of the total displacement can be obtained by measuring velocity at regular intervals and multiplying each value by the corresponding time step.If a runner accelerates over the first three seconds of a race, speed measurements...
Residuals and Least-Squares Property
The vertical distance between the actual value of y and the estimated value of y. In other words, it measures the vertical distance between the actual data point and the predicted point on the line
If the observed data point lies above the line, the residual is positive, and the line underestimates the actual data value for y. If the observed data point lies below the line, the residual is negative, and the line overestimates the actual data value for y.
The process of fitting the best-fit...
If the observed data point lies above the line, the residual is positive, and the line underestimates the actual data value for y. If the observed data point lies below the line, the residual is negative, and the line overestimates the actual data value for y.
The process of fitting the best-fit...