{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/model-selection/papers/20","list_of":"/task/model-selection","task":"Model Selection","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":20,"pages_in_order":21,"rows_per_page":100,"rows":[1901,2000],"of":2050,"counts":{"archive_papers_tagged":2050,"with_a_code_link":658,"where_syntology_ran_a_sample":141,"not_listed_spam_title":0,"listed":2050,"listed_where_code_ran":141,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":115,"every_run_a_failure_of_syntologys_instrument":26,"listed_with_a_run_with_no_instrument_failure":115,"listed_every_run_a_failure_of_syntologys_instrument":26,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/model-selection","prev":"/task/model-selection/papers/19","next":"/task/model-selection/papers/21","papers":[{"url":null,"slug":"homotopy-continuation-approaches-for-robust","title":"Homotopy Continuation Approaches for Robust SV Classification and Regression","date":"2015-07-12","arxiv_id":"1507.03229","repositories_listed":0,"syntology":null},{"url":null,"slug":"model-selection-for-type-supervised-learning","title":"Model Selection for Type-Supervised Learning with Application to POS Tagging","date":"2015-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-equivalence-of-factorized-information","title":"On the Equivalence of Factorized Information Criterion Regularization and the Chinese Restaurant Process Prior","date":"2015-06-30","arxiv_id":"1506.09068","repositories_listed":0,"syntology":null},{"url":null,"slug":"selective-inference-and-learning-mixed","title":"Selective Inference and Learning Mixed Graphical Models","date":"2015-06-30","arxiv_id":"1507.00039","repositories_listed":0,"syntology":null},{"url":null,"slug":"factorized-asymptotic-bayesian-inference-for","title":"Factorized Asymptotic Bayesian Inference for Factorial Hidden Markov Models","date":"2015-06-26","arxiv_id":"1506.07959","repositories_listed":0,"syntology":null},{"url":null,"slug":"detecting-adaptive-evolution-in-phylogenetic","title":"Detecting adaptive evolution in phylogenetic comparative analysis using the Ornstein-Uhlenbeck model","date":"2015-06-25","arxiv_id":"1506.07906","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-simple-application-of-fic-to-model","title":"A simple application of FIC to model selection","date":"2015-06-19","arxiv_id":"1506.06129","repositories_listed":0,"syntology":null},{"url":null,"slug":"information-based-inference-for-singular","title":"Information-based inference for singular models and finite sample sizes: A frequentist information criterion","date":"2015-06-19","arxiv_id":"1506.05855","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalized-additive-model-selection","title":"Generalized Additive Model Selection","date":"2015-06-11","arxiv_id":"1506.03850","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-driven-learning-of-the-number-of-states","title":"Data-Driven Learning of the Number of States in Multi-State Autoregressive Models","date":"2015-06-06","arxiv_id":"1506.02107","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-adaptive-matrix-factorization-with","title":"Bayesian Adaptive Matrix Factorization With Automatic Model Selection","date":"2015-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"automatic-relevance-determination-for-deep","title":"Automatic Relevance Determination For Deep Generative Models","date":"2015-05-28","arxiv_id":"1505.07765","repositories_listed":0,"syntology":null},{"url":null,"slug":"bootstrapped-adaptive-threshold-selection-for","title":"Bootstrapped Adaptive Threshold Selection for Statistical Model Selection and Estimation","date":"2015-05-13","arxiv_id":"1505.03511","repositories_listed":0,"syntology":null},{"url":null,"slug":"simultaneous-clustering-and-model-selection","title":"Simultaneous Clustering and Model Selection for Multinomial Distribution: A Comparative Study","date":"2015-05-09","arxiv_id":"1505.02324","repositories_listed":0,"syntology":null},{"url":null,"slug":"cats-co-categorical-time-series-coclustering","title":"Cats & Co: Categorical Time Series Coclustering","date":"2015-05-06","arxiv_id":"1505.01300","repositories_listed":0,"syntology":null},{"url":null,"slug":"kernel-spectral-clustering-and-applications","title":"Kernel Spectral Clustering and applications","date":"2015-05-03","arxiv_id":"1505.00477","repositories_listed":0,"syntology":null},{"url":null,"slug":"response-based-learning-for-machine","title":"Response-based Learning for Machine Translation of Open-domain Database Queries","date":"2015-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"model-selection-and-overfitting-in-genetic","title":"Model Selection and Overfitting in Genetic Programming: Empirical Study [Extended Version]","date":"2015-04-30","arxiv_id":"1504.08168","repositories_listed":0,"syntology":null},{"url":null,"slug":"meta-learning-of-bounds-on-the-bayes","title":"Meta learning of bounds on the Bayes classifier error","date":"2015-04-27","arxiv_id":"1504.07116","repositories_listed":0,"syntology":null},{"url":null,"slug":"rebuilding-factorized-information-criterion","title":"Rebuilding Factorized Information Criterion: Asymptotically Accurate Marginal Likelihood","date":"2015-04-22","arxiv_id":"1504.05665","repositories_listed":0,"syntology":null},{"url":null,"slug":"time-resolution-dependence-of-information","title":"Time Resolution Dependence of Information Measures for Spiking Neurons: Atoms, Scaling, and Universality","date":"2015-04-18","arxiv_id":"1504.04756","repositories_listed":0,"syntology":null},{"url":null,"slug":"comparison-of-bayesian-predictive-methods-for","title":"Comparison of Bayesian predictive methods for model selection","date":"2015-03-30","arxiv_id":"1503.08650","repositories_listed":0,"syntology":null},{"url":null,"slug":"qualitative-inequalities-for-squared-partial","title":"Qualitative inequalities for squared partial correlations of a Gaussian random vector","date":"2015-03-12","arxiv_id":"1503.03879","repositories_listed":0,"syntology":null},{"url":null,"slug":"model-selection-of-polynomial-kernel","title":"Model selection of polynomial kernel regression","date":"2015-03-07","arxiv_id":"1503.02143","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-confident-information-first-principle-for","title":"A Confident Information First Principle for Parametric Reduction and Model Selection of Boltzmann Machines","date":"2015-02-05","arxiv_id":"1502.01705","repositories_listed":0,"syntology":null},{"url":null,"slug":"dirichlet-process-parsimonious-mixtures-for","title":"Dirichlet Process Parsimonious Mixtures for clustering","date":"2015-01-14","arxiv_id":"1501.03347","repositories_listed":0,"syntology":null},{"url":null,"slug":"spatiotemporal-clustering-climate-periodicity","title":"Spatiotemporal clustering, climate periodicity, and social-ecological risk factors for dengue during an outbreak in Machala, Ecuador, in 2010","date":"2015-01-13","arxiv_id":"1407.7913","repositories_listed":0,"syntology":null},{"url":null,"slug":"scaling-up-empirical-risk-minimization","title":"Scaling-up Empirical Risk Minimization: Optimization of Incomplete U-statistics","date":"2015-01-12","arxiv_id":"1501.02629","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-model-misspecification-and-kl-separation","title":"On model misspecification and KL separation for Gaussian graphical models","date":"2015-01-10","arxiv_id":"1501.02320","repositories_listed":0,"syntology":null},{"url":null,"slug":"marginal-likelihood-and-model-selection-for","title":"Marginal likelihood and model selection for Gaussian latent tree and forest models","date":"2014-12-29","arxiv_id":"1412.8285","repositories_listed":0,"syntology":null},{"url":null,"slug":"model-selection-in-high-dimensional","title":"Model Selection in High-Dimensional Misspecified Models","date":"2014-12-23","arxiv_id":"1412.7468","repositories_listed":0,"syntology":null},{"url":null,"slug":"testing-and-confidence-intervals-for-high","title":"Testing and Confidence Intervals for High Dimensional Proportional Hazards Model","date":"2014-12-16","arxiv_id":"1412.5158","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-application-of-the-bayes-ying-yang","title":"The application of the Bayes Ying Yang harmony based GMMs in on-line signature verification","date":"2014-12-13","arxiv_id":"1412.4205","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantile-universal-threshold-model-selection","title":"Quantile universal threshold: model selection at the detection edge for high-dimensional linear regression","date":"2014-12-05","arxiv_id":"1412.1927","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-many-communities-are-there","title":"How Many Communities Are There?","date":"2014-12-04","arxiv_id":"1412.1684","repositories_listed":0,"syntology":null},{"url":null,"slug":"quic-dirty-a-quadratic-approximation-approach","title":"QUIC & DIRTY: A Quadratic Approximation Approach for Dirty Statistical Models","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-nonparametric-bayesian-approach-to","title":"A Nonparametric Bayesian Approach to Uncovering Rat Hippocampal Population Codes During Spatial Navigation","date":"2014-11-27","arxiv_id":"1411.7706","repositories_listed":0,"syntology":null},{"url":null,"slug":"convex-techniques-for-model-selection","title":"Convex Techniques for Model Selection","date":"2014-11-27","arxiv_id":"1411.7596","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-evolving-data-using-kernel-based","title":"Clustering evolving data using kernel-based methods","date":"2014-11-20","arxiv_id":"1411.5988","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-to-scale-up-kernel-methods-to-be-as-good","title":"How to Scale Up Kernel Methods to Be As Good As Deep Neural Nets","date":"2014-11-14","arxiv_id":"1411.4000","repositories_listed":0,"syntology":null},{"url":null,"slug":"greedy-metrics-in-orthogonal-greedy-learning","title":"Greedy metrics in orthogonal greedy learning","date":"2014-11-13","arxiv_id":"1411.3553","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-modeling-for-image-and-vision","title":"Sparse Modeling for Image and Vision Processing","date":"2014-11-12","arxiv_id":"1411.3230","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-evidence-and-model-selection","title":"Bayesian Evidence and Model Selection","date":"2014-11-11","arxiv_id":"1411.3013","repositories_listed":0,"syntology":null},{"url":null,"slug":"median-selection-subset-aggregation-for","title":"Median Selection Subset Aggregation for Parallel Inference","date":"2014-10-24","arxiv_id":"1410.6604","repositories_listed":0,"syntology":null},{"url":null,"slug":"model-selection-for-topic-models-via-spectral","title":"Model Selection for Topic Models via Spectral Decomposition","date":"2014-10-23","arxiv_id":"1410.6466","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-robust-tensor-factorization-for","title":"Bayesian Robust Tensor Factorization for Incomplete Multiway Data","date":"2014-10-09","arxiv_id":"1410.2386","repositories_listed":0,"syntology":null},{"url":null,"slug":"graphical-lasso-based-model-selection-for","title":"Graphical LASSO Based Model Selection for Time Series","date":"2014-10-05","arxiv_id":"1410.1184","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-manifold-to-regularize-nonnegative","title":"Learning manifold to regularize nonnegative matrix factorization","date":"2014-10-03","arxiv_id":"1410.2191","repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-learning-of-regression-mixture","title":"Unsupervised learning of regression mixture models with unknown number of components","date":"2014-09-24","arxiv_id":"1409.6981","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimization-methods-for-sparse-pseudo","title":"Optimization Methods for Sparse Pseudo-Likelihood Graphical Model Selection","date":"2014-09-12","arxiv_id":"1409.3768","repositories_listed":0,"syntology":null},{"url":null,"slug":"look-ma-no-hands-a-parameter-free-topic-model","title":"\"Look Ma, No Hands!\" A Parameter-Free Topic Model","date":"2014-09-10","arxiv_id":"1409.2993","repositories_listed":0,"syntology":null},{"url":null,"slug":"kernel-based-information-criterion","title":"Kernel-based Information Criterion","date":"2014-08-25","arxiv_id":"1408.5810","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-graphical-modeling-with-t","title":"Robust Graphical Modeling with t-Distributions","date":"2014-08-09","arxiv_id":"1408.2033","repositories_listed":0,"syntology":null},{"url":null,"slug":"volumes-of-logistic-regression-models-with","title":"Volumes of logistic regression models with applications to model selection","date":"2014-08-05","arxiv_id":"1408.0881","repositories_listed":0,"syntology":null},{"url":null,"slug":"nonparametric-hierarchical-clustering-of","title":"Nonparametric Hierarchical Clustering of Functional Data","date":"2014-07-02","arxiv_id":"1407.0612","repositories_listed":0,"syntology":null},{"url":null,"slug":"automatic-dimension-selection-for-a-non","title":"Automatic Dimension Selection for a Non-negative Factorization Approach to Clustering Multiple Random Graphs","date":"2014-06-24","arxiv_id":"1406.6315","repositories_listed":0,"syntology":null},{"url":null,"slug":"reliable-abc-model-choice-via-random-forests","title":"Reliable ABC model choice via random forests","date":"2014-06-24","arxiv_id":"1406.6288","repositories_listed":0,"syntology":null},{"url":null,"slug":"techniques-for-clustering-interaction-data-as","title":"Techniques for clustering interaction data as a collection of graphs","date":"2014-06-24","arxiv_id":"1406.6319","repositories_listed":0,"syntology":null},{"url":null,"slug":"simultaneous-model-selection-and-optimization","title":"Simultaneous Model Selection and Optimization through Parameter-free Stochastic Learning","date":"2014-06-15","arxiv_id":"1406.3816","repositories_listed":0,"syntology":null},{"url":null,"slug":"scams-simultaneous-clustering-and-model","title":"SCAMS: Simultaneous Clustering and Model Selection","date":"2014-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-with-many-experts-model-selection","title":"Learning with many experts: model selection and sparsity","date":"2014-05-13","arxiv_id":"1405.3292","repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-protein-dynamics-with-l1","title":"Understanding Protein Dynamics with L1-Regularized Reversible Hidden Markov Models","date":"2014-05-06","arxiv_id":"1405.1444","repositories_listed":0,"syntology":null},{"url":null,"slug":"model-consistency-of-partly-smooth","title":"Model Consistency of Partly Smooth Regularizers","date":"2014-05-05","arxiv_id":"1405.1004","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-from-domain-complexity","title":"Learning from Domain Complexity","date":"2014-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"active-learning-for-undirected-graphical","title":"Active Learning for Undirected Graphical Model Selection","date":"2014-04-13","arxiv_id":"1404.3418","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-permutation-approach-for-selecting-the","title":"A Permutation Approach for Selecting the Penalty Parameter in Penalized Model Selection","date":"2014-04-08","arxiv_id":"1404.2007","repositories_listed":0,"syntology":null},{"url":null,"slug":"selective-factor-extraction-in-high","title":"Selective Factor Extraction in High Dimensions","date":"2014-03-25","arxiv_id":"1403.6212","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-interval-clustering-application-to","title":"Optimal interval clustering: Application to Bregman clustering and statistical mixture learning","date":"2014-03-11","arxiv_id":"1403.2485","repositories_listed":0,"syntology":null},{"url":null,"slug":"exact-post-model-selection-inference-for-1","title":"Exact Post Model Selection Inference for Marginal Screening","date":"2014-02-23","arxiv_id":"1402.5596","repositories_listed":0,"syntology":null},{"url":null,"slug":"path-thresholding-asymptotically-tuning-free","title":"Path Thresholding: Asymptotically Tuning-Free High-Dimensional Sparse Regression","date":"2014-02-23","arxiv_id":"1402.5584","repositories_listed":0,"syntology":null},{"url":null,"slug":"classification-with-sparse-overlapping-groups","title":"Classification with Sparse Overlapping Groups","date":"2014-02-18","arxiv_id":"1402.4512","repositories_listed":0,"syntology":null},{"url":null,"slug":"student-t-processes-as-alternatives-to","title":"Student-t Processes as Alternatives to Gaussian Processes","date":"2014-02-18","arxiv_id":"1402.4306","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-algorithmic-framework-for-computing","title":"An Algorithmic Framework for Computing Validation Performance Bounds by Using Suboptimal Models","date":"2014-02-10","arxiv_id":"1402.2148","repositories_listed":0,"syntology":null},{"url":null,"slug":"sequential-model-based-ensemble-optimization","title":"Sequential Model-Based Ensemble Optimization","date":"2014-02-04","arxiv_id":"1402.0796","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-large-scale-evaluation-of-distributional","title":"A Large Scale Evaluation of Distributional Semantic Models: Parameters, Interactions and Model Selection","date":"2014-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-model-selection-approach-for-clustering-a","title":"A model selection approach for clustering a multinomial sequence with non-negative factorization","date":"2013-12-29","arxiv_id":"1312.7559","repositories_listed":0,"syntology":null},{"url":null,"slug":"markov-network-structure-learning-via","title":"Markov Network Structure Learning via Ensemble-of-Forests Models","date":"2013-12-17","arxiv_id":"1312.4710","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-hierarchical-community-discovery","title":"Bayesian Hierarchical Community Discovery","date":"2013-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"factorized-asymptotic-bayesian-inference-for-1","title":"Factorized Asymptotic Bayesian Inference for Latent Feature Models","date":"2013-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-adaptive-value-of-information-for","title":"Learning Adaptive Value of Information for Structured Prediction","date":"2013-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-model-selection-consistency-of-penalized-m","title":"On model selection consistency of penalized M-estimators: a geometric theory","date":"2013-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-inverse-covariance-estimation-with","title":"Sparse Inverse Covariance Estimation with Calibration","date":"2013-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"exact-post-selection-inference-with","title":"Exact post-selection inference, with application to the lasso","date":"2013-11-25","arxiv_id":"1311.6238","repositories_listed":0,"syntology":null},{"url":null,"slug":"score-based-causal-learning-in-additive-noise","title":"Score-based Causal Learning in Additive Noise Models","date":"2013-11-25","arxiv_id":"1311.6359","repositories_listed":0,"syntology":null},{"url":null,"slug":"compressive-nonparametric-graphical-model","title":"Compressive Nonparametric Graphical Model Selection For Time Series","date":"2013-11-13","arxiv_id":"1311.3257","repositories_listed":0,"syntology":null},{"url":null,"slug":"aggregation-of-affine-estimators","title":"Aggregation of Affine Estimators","date":"2013-11-12","arxiv_id":"1311.2799","repositories_listed":0,"syntology":null},{"url":null,"slug":"parsimonious-shifted-asymmetric-laplace","title":"Parsimonious Shifted Asymmetric Laplace Mixtures","date":"2013-11-01","arxiv_id":"1311.0317","repositories_listed":0,"syntology":null},{"url":null,"slug":"combined-l_1-and-greedy-l_0-penalized-least","title":"Combined l_1 and greedy l_0 penalized least squares for linear model selection","date":"2013-10-22","arxiv_id":"1310.6062","repositories_listed":0,"syntology":null},{"url":null,"slug":"speedy-model-selection-sms-for-copula-models","title":"Speedy Model Selection (SMS) for Copula Models","date":"2013-09-26","arxiv_id":"1309.6867","repositories_listed":0,"syntology":null},{"url":null,"slug":"likelihood-adaptively-modified-penalties","title":"Likelihood Adaptively Modified Penalties","date":"2013-08-23","arxiv_id":"1308.5036","repositories_listed":0,"syntology":null},{"url":null,"slug":"risk-consistency-of-cross-validation-with","title":"Risk-consistency of cross-validation with lasso-type procedures","date":"2013-08-04","arxiv_id":"1308.0810","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-convex-pseudo-likelihood-framework-for-high","title":"A convex pseudo-likelihood framework for high dimensional partial correlation estimation with convergence guarantees","date":"2013-07-20","arxiv_id":"1307.5381","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-cluster-graphical-lasso-for-improved","title":"The Cluster Graphical Lasso for improved estimation of Gaussian graphical models","date":"2013-07-19","arxiv_id":"1307.5339","repositories_listed":0,"syntology":null},{"url":null,"slug":"fuzzy-fibers-uncertainty-in-dmri-tractography","title":"Fuzzy Fibers: Uncertainty in dMRI Tractography","date":"2013-07-11","arxiv_id":"1307.3271","repositories_listed":0,"syntology":null},{"url":null,"slug":"bridging-information-criteria-and-parameter","title":"Bridging Information Criteria and Parameter Shrinkage for Model Selection","date":"2013-07-08","arxiv_id":"1307.2307","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-efficient-model-selection-for-gaussian","title":"An Efficient Model Selection for Gaussian Mixture Model in a Bayesian Framework","date":"2013-07-03","arxiv_id":"1307.0995","repositories_listed":0,"syntology":null},{"url":null,"slug":"dimensionality-detection-and-integration-of","title":"Dimensionality Detection and Integration of Multiple Data Sources via the GP-LVM","date":"2013-07-01","arxiv_id":"1307.0323","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-variational-approximations-dic-rubric-for","title":"A Variational Approximations-DIC Rubric for Parameter Estimation and Mixture Model Selection Within a Family Setting","date":"2013-06-23","arxiv_id":"1306.5368","repositories_listed":0,"syntology":null},{"url":null,"slug":"segmentation-et-interpretation-de-nuages-de","title":"Segmentation et Interprétation de Nuages de Points pour la Modélisation d'Environnements Urbains","date":"2013-06-13","arxiv_id":"1306.3084","repositories_listed":0,"syntology":null},{"url":null,"slug":"generative-model-selection-using-a-scalable","title":"Generative Model Selection Using a Scalable and Size-Independent Complex Network Classifier","date":"2013-06-10","arxiv_id":"1306.2298","repositories_listed":0,"syntology":null}],"record_sha256":"5e79580ee1f7f86dcd9da3305312a854fcaefb68bcc9fed7e28ce03608f647ca","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}