Graph Bisection Algorithm
An algorithm that partitions the vertices of a graph into two disjoint subsets while minimizing the number of edges between the subsets.
An algorithm that partitions the vertices of a graph into two disjoint subsets while minimizing the number of edges between the subsets.
A method for selectively updating the policy based on high-confidence performance estimations to improve the stability and convergence of reinforcement learning algorithms.
Inference strategies tailored to improve model performance on specific benchmarks by predicting sensory information.
A baseline model that discards temporal structure and utilizes a bag-of-words approach with SigLIP for video analysis.
A model that uses a bag-of-words approach for processing video data, focusing on significant visual features.
A class of algorithms in reinforcement learning that optimize the policy directly by adjusting the parameters in the direction of the gradient of expected reward.
A retraining process that takes into account the sparsity of the model, focusing on recovering performance without reactivating pruned connections.
A pruning strategy that eliminates weights in a single pass rather than through iterative cycles of training and pruning.
A method of reducing the size of neural networks by removing individual weights based on certain criteria, rather than entire neurons or layers.
A process where a smaller model is trained to replicate the behavior of a larger, pre-trained model, effectively transferring knowledge.