SOTAVerified

Model Selection

Given a set of candidate models, the goal of Model Selection is to select the model that best approximates the observed data and captures its underlying regularities. Model Selection criteria are defined such that they strike a balance between the goodness of fit, and the generalizability or complexity of the models.

Source: Kernel-based Information Criterion

Papers

Recently AddedMost HypedMost ActiveNeeds VerificationMost Verified

Showing 1251–1275 of 2050 papers

TitleStatusHype
Tensor Ring Decomposition with Rank Minimization on Latent Space: An Efficient Approach for Tensor Completion—0
Testing and Confidence Intervals for High Dimensional Proportional Hazards Model—0
The application of the Bayes Ying Yang harmony based GMMs in on-line signature verification—0
The Cluster Graphical Lasso for improved estimation of Gaussian graphical models—0
The column measure and Gradient-Free Gradient Boosting—0
The Cost of Arbitrariness for Individuals: Examining the Legal and Technical Challenges of Model Multiplicity—0
The Deep Latent Position Topic Model for Clustering and Representation of Networks with Textual Edges—0
The #DNN-Verification Problem: Counting Unsafe Inputs for Deep Neural Networks—0
The Economic Implications of Large Language Model Selection on Earnings and Return on Investment: A Decision Theoretic Model—0
The Evolution of Multimodal Model Architectures—0
The Future of Employment Revisited: How Model Selection Determines Automation Forecasts—0
The huge Package for High-dimensional Undirected Graph Estimation in R—0
The Impact of Unlabeled Patterns in Rademacher Complexity Theory for Kernel Classifiers—0
The Infinite Contextual Graph Markov Model—0
The Interpolating Information Criterion for Overparameterized Models—0
The LASSO risk: asymptotic results and real world examples—0
The Majority Vote Paradigm Shift: When Popular Meets Optimal—0
The Minimum Description Length Principle for Pattern Mining: A Survey—0
The Paradox of Stochasticity: Limited Creativity and Computational Decoupling in Temperature-Varied LLM Outputs of Structured Fictional Data—0
The Pareto Frontier of model selection for general Contextual Bandits—0
The PRIMPing Routine -- Tiling through Proximal Alternating Linearized Minimization—0
The Quality of the Covariance Selection Through Detection Problem and AUC Bounds—0
Thermodynamic Bayesian Inference—0
The Sample Complexity of Parameter-Free Stochastic Convex Optimization—0
The smooth output assumption, and why deep networks are better than wide ones—0
Show:102550
← PrevPage 51 of 82Next →

No leaderboard results yet.