{"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/parameter-estimation/papers/17","list_of":"/task/parameter-estimation","task":"parameter estimation","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":17,"pages_in_order":18,"rows_per_page":100,"rows":[1601,1700],"of":1719,"counts":{"archive_papers_tagged":1719,"with_a_code_link":369,"where_syntology_ran_a_sample":53,"not_listed_spam_title":0,"listed":1719,"listed_where_code_ran":53,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":45,"every_run_a_failure_of_syntologys_instrument":8,"listed_with_a_run_with_no_instrument_failure":45,"listed_every_run_a_failure_of_syntologys_instrument":8,"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/parameter-estimation","prev":"/task/parameter-estimation/papers/16","next":"/task/parameter-estimation/papers/18","papers":[{"url":null,"slug":"convolutional-dictionary-learning-through","title":"Convolutional Dictionary Learning through Tensor Factorization","date":"2015-06-10","arxiv_id":"1506.03509","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-inference-for-neighborhood-filters","title":"Bayesian Inference for Neighborhood Filters With Application in Denoising","date":"2015-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-dynamic-feature-selection-for-fast","title":"Learning Dynamic Feature Selection for Fast Sequential Prediction","date":"2015-05-22","arxiv_id":"1505.06169","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-stability-and-optimality-in","title":"Towards stability and optimality in stochastic gradient descent","date":"2015-05-10","arxiv_id":"1505.02417","repositories_listed":0,"syntology":null},{"url":null,"slug":"when-and-why-are-log-linear-models-self","title":"When and why are log-linear models self-normalizing?","date":"2015-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-randomized-dimension-reduction-on","title":"Adaptive Randomized Dimension Reduction on Massive Data","date":"2015-04-13","arxiv_id":"1504.03183","repositories_listed":0,"syntology":null},{"url":null,"slug":"shared-latent-subspace-modelling-within","title":"Shared latent subspace modelling within Gaussian-Binary Restricted Boltzmann Machines for NIST i-Vector Challenge 2014","date":"2015-03-18","arxiv_id":"1503.05471","repositories_listed":0,"syntology":null},{"url":null,"slug":"parameter-estimation-and-bifurcation-analysis","title":"Parameter estimation and bifurcation analysis of stochastic models of gene regulatory networks: tensor-structured methods","date":"2015-03-15","arxiv_id":"1406.7825","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-clustered-convolutional-kernels","title":"Deep Clustered Convolutional Kernels","date":"2015-03-06","arxiv_id":"1503.01824","repositories_listed":0,"syntology":null},{"url":null,"slug":"parameter-estimation-in-softmax-decision","title":"Parameter estimation in softmax decision-making models with linear objective functions","date":"2015-02-16","arxiv_id":"1502.04635","repositories_listed":0,"syntology":null},{"url":null,"slug":"probabilistic-models-for-high-order","title":"Probabilistic Models for High-Order Projective Dependency Parsing","date":"2015-02-14","arxiv_id":"1502.04174","repositories_listed":0,"syntology":null},{"url":null,"slug":"identifiability-and-optimal-rates-of","title":"Identifiability and optimal rates of convergence for parameters of multiple types in finite mixtures","date":"2015-01-11","arxiv_id":"1501.02497","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-general-framework-for-robust-testing-and","title":"A General Framework for Robust Testing and Confidence Regions in High-Dimensional Quantile Regression","date":"2014-12-30","arxiv_id":"1412.8724","repositories_listed":0,"syntology":null},{"url":null,"slug":"high-dimensional-expectation-maximization","title":"High Dimensional Expectation-Maximization Algorithm: Statistical Optimization and Asymptotic Normality","date":"2014-12-30","arxiv_id":"1412.8729","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-semiparametric-exponential-family","title":"On Semiparametric Exponential Family Graphical Models","date":"2014-12-30","arxiv_id":"1412.8697","repositories_listed":0,"syntology":null},{"url":null,"slug":"pathwise-coordinate-optimization-for-sparse","title":"Pathwise Coordinate Optimization for Sparse Learning: Algorithm and Theory","date":"2014-12-23","arxiv_id":"1412.7477","repositories_listed":0,"syntology":null},{"url":null,"slug":"decomposing-parameter-estimation-problems","title":"Decomposing Parameter Estimation Problems","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"large-scale-l-bfgs-using-mapreduce","title":"Large-scale L-BFGS using MapReduce","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"multivariate-regression-with-calibration","title":"Multivariate Regression with Calibration","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"recursive-inversion-models-for-permutations","title":"Recursive Inversion Models for Permutations","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"noise-benefits-in-expectation-maximization","title":"Noise Benefits in Expectation-Maximization Algorithms","date":"2014-11-24","arxiv_id":"1411.6622","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-kernel-density-estimation-by-scaling","title":"Robust Kernel Density Estimation by Scaling and Projection in Hilbert Space","date":"2014-11-17","arxiv_id":"1411.4378","repositories_listed":0,"syntology":null},{"url":null,"slug":"statistical-models-for-degree-distributions","title":"Statistical Models for Degree Distributions of Networks","date":"2014-11-14","arxiv_id":"1411.3825","repositories_listed":0,"syntology":null},{"url":null,"slug":"speaker-identification-from-youtube-obtained","title":"Speaker Identification From Youtube Obtained Data","date":"2014-11-11","arxiv_id":"1411.2795","repositories_listed":0,"syntology":null},{"url":null,"slug":"parameter-estimation-in-spherical-symmetry","title":"Parameter estimation in spherical symmetry groups","date":"2014-11-10","arxiv_id":"1411.2540","repositories_listed":0,"syntology":null},{"url":null,"slug":"large-margin-determinantal-point-processes","title":"Large-Margin Determinantal Point Processes","date":"2014-11-06","arxiv_id":"1411.1537","repositories_listed":0,"syntology":null},{"url":null,"slug":"sublinear-time-approximate-mcmc-transitions","title":"Sublinear-Time Approximate MCMC Transitions for Probabilistic Programs","date":"2014-11-06","arxiv_id":"1411.1690","repositories_listed":0,"syntology":null},{"url":null,"slug":"multivariate-response-and-parsimony-for","title":"Multivariate response and parsimony for Gaussian cluster-weighted models","date":"2014-11-03","arxiv_id":"1411.0560","repositories_listed":0,"syntology":null},{"url":null,"slug":"training-for-fast-sequential-prediction-using","title":"Training for Fast Sequential Prediction Using Dynamic Feature Selection","date":"2014-10-30","arxiv_id":"1410.8498","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-estimation-of-the-multifractality","title":"Bayesian estimation of the multifractality parameter for image texture using a Whittle approximation","date":"2014-10-17","arxiv_id":"1410.4871","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-low-complexity-sequential-inference","title":"Adaptive Low-Complexity Sequential Inference for Dirichlet Process Mixture Models","date":"2014-09-29","arxiv_id":"1409.8185","repositories_listed":0,"syntology":null},{"url":null,"slug":"real-time-crowd-tracking-using-parameter","title":"Real-time Crowd Tracking using Parameter Optimized Mixture of Motion Models","date":"2014-09-16","arxiv_id":"1409.4481","repositories_listed":0,"syntology":null},{"url":null,"slug":"hardness-of-parameter-estimation-in-graphical","title":"Hardness of parameter estimation in graphical models","date":"2014-09-12","arxiv_id":"1409.3836","repositories_listed":0,"syntology":null},{"url":null,"slug":"context-specific-independence-in-graphical","title":"Context-specific independence in graphical log-linear models","date":"2014-09-09","arxiv_id":"1409.2713","repositories_listed":0,"syntology":null},{"url":null,"slug":"asymptotic-and-finite-sample-properties-of","title":"Asymptotic and finite-sample properties of estimators based on stochastic gradients","date":"2014-08-13","arxiv_id":"1408.2923","repositories_listed":0,"syntology":null},{"url":null,"slug":"low-rank-sift-an-affine-invariant-feature-for","title":"Low-rank SIFT: An Affine Invariant Feature for Place Recognition","date":"2014-08-07","arxiv_id":"1408.1688","repositories_listed":0,"syntology":null},{"url":null,"slug":"rankmerging-a-supervised-learning-to-rank","title":"RankMerging: A supervised learning-to-rank framework to predict links in large social network","date":"2014-07-09","arxiv_id":"1407.2515","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-latent-tree-model-and-its","title":"Guaranteed Scalable Learning of Latent Tree Models","date":"2014-06-18","arxiv_id":"1406.4566","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-parameter-estimation-in","title":"Distributed Parameter Estimation in Probabilistic Graphical Models","date":"2014-06-11","arxiv_id":"1406.3070","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-latent-variable-gaussian-graphical","title":"Learning Latent Variable Gaussian Graphical Models","date":"2014-06-10","arxiv_id":"1406.2721","repositories_listed":0,"syntology":null},{"url":null,"slug":"newton-greedy-pursuit-a-quadratic","title":"Newton Greedy Pursuit: A Quadratic Approximation Method for Sparsity-Constrained Optimization","date":"2014-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"predicting-failures-of-vision-systems","title":"Predicting Failures of Vision Systems","date":"2014-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"seeking-multi-thresholds-for-image","title":"Seeking multi-thresholds for image segmentation with Learning Automata","date":"2014-05-28","arxiv_id":"1405.7361","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-communication-cost-of-distributed","title":"On Communication Cost of Distributed Statistical Estimation and Dimensionality","date":"2014-05-07","arxiv_id":"1405.1665","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimality-guarantees-for-distributed","title":"Optimality guarantees for distributed statistical estimation","date":"2014-05-05","arxiv_id":"1405.0782","repositories_listed":0,"syntology":null},{"url":null,"slug":"asymmetric-clusters-and-outliers-mixtures-of","title":"Asymmetric Clusters and Outliers: Mixtures of Multivariate Contaminated Shifted Asymmetric Laplace Distributions","date":"2014-02-26","arxiv_id":"1402.6744","repositories_listed":0,"syntology":null},{"url":null,"slug":"parameter-estimation-based-on-interval-valued","title":"Parameter estimation based on interval-valued belief structures","date":"2014-02-15","arxiv_id":"1402.3664","repositories_listed":0,"syntology":null},{"url":null,"slug":"ranking-via-robust-binary-classification-and","title":"Ranking via Robust Binary Classification and Parallel Parameter Estimation in Large-Scale Data","date":"2014-02-11","arxiv_id":"1402.2676","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-generalized-probabilistic-framework-for","title":"A Generalized Probabilistic Framework for Compact Codebook Creation","date":"2014-01-30","arxiv_id":"1401.7713","repositories_listed":0,"syntology":null},{"url":null,"slug":"nonparametric-latent-tree-graphical-models","title":"Nonparametric Latent Tree Graphical Models: Inference, Estimation, and Structure Learning","date":"2014-01-16","arxiv_id":"1401.3940","repositories_listed":0,"syntology":null},{"url":null,"slug":"model-based-clustering-with-hidden-markov","title":"Model-based clustering with Hidden Markov Model regression for time series with regime changes","date":"2013-12-25","arxiv_id":"1312.7024","repositories_listed":0,"syntology":null},{"url":null,"slug":"comparative-analysis-of-viterbi-training-and","title":"Comparative Analysis of Viterbi Training and Maximum Likelihood Estimation for HMMs","date":"2013-12-16","arxiv_id":"1312.4551","repositories_listed":0,"syntology":null},{"url":null,"slug":"families-of-parsimonious-finite-mixtures-of","title":"Families of Parsimonious Finite Mixtures of Regression Models","date":"2013-12-02","arxiv_id":"1312.0518","repositories_listed":0,"syntology":null},{"url":null,"slug":"confidence-intervals-and-hypothesis-testing-1","title":"Confidence Intervals and Hypothesis Testing for High-Dimensional Statistical Models","date":"2013-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"edml-for-learning-parameters-in-directed-and","title":"EDML for Learning Parameters in Directed and Undirected Graphical Models","date":"2013-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"relevance-topic-model-for-unstructured-social","title":"Relevance Topic Model for Unstructured Social Group Activity Recognition","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":"gradient-hard-thresholding-pursuit-for","title":"Gradient Hard Thresholding Pursuit for Sparsity-Constrained Optimization","date":"2013-11-22","arxiv_id":"1311.5750","repositories_listed":0,"syntology":null},{"url":null,"slug":"joint-estimation-of-multiple-graphical-models","title":"Joint Estimation of Multiple Graphical Models from High Dimensional Time Series","date":"2013-11-01","arxiv_id":"1311.0219","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":"deep-autoregressive-networks","title":"Deep AutoRegressive Networks","date":"2013-10-31","arxiv_id":"1310.8499","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-information-geometry-of-mirror-descent","title":"The Information Geometry of Mirror Descent","date":"2013-10-29","arxiv_id":"1310.7780","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-parameter-estimation-of-discrete","title":"Distributed parameter estimation of discrete hierarchical models via marginal likelihoods","date":"2013-10-21","arxiv_id":"1310.5666","repositories_listed":0,"syntology":null},{"url":null,"slug":"linearized-alternating-direction-method-with","title":"Linearized Alternating Direction Method with Parallel Splitting and Adaptive Penalty for Separable Convex Programs in Machine Learning","date":"2013-10-18","arxiv_id":"1310.5035","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-unsupervised-parameter-estimation","title":"An Unsupervised Parameter Estimation Algorithm for a Generative Dependency N-gram Language Model","date":"2013-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"surface-registration-using-genetic-algorithm","title":"Surface Registration Using Genetic Algorithm in Reduced Search Space","date":"2013-10-01","arxiv_id":"1310.0302","repositories_listed":0,"syntology":null},{"url":null,"slug":"constrained-bayesian-inference-for-low-rank","title":"Constrained Bayesian Inference for Low Rank Multitask Learning","date":"2013-09-26","arxiv_id":"1309.6840","repositories_listed":0,"syntology":null},{"url":null,"slug":"exponentially-fast-parameter-estimation-in","title":"Exponentially Fast Parameter Estimation in Networks Using Distributed Dual Averaging","date":"2013-09-10","arxiv_id":"1309.2350","repositories_listed":0,"syntology":null},{"url":null,"slug":"variational-bayes-approximations-for","title":"Variational Bayes Approximations for Clustering via Mixtures of Normal Inverse Gaussian Distributions","date":"2013-09-07","arxiv_id":"1309.1901","repositories_listed":0,"syntology":null},{"url":null,"slug":"discriminative-parameter-estimation-for-1","title":"Discriminative Parameter Estimation for Random Walks Segmentation","date":"2013-08-30","arxiv_id":"1308.6721","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":"a-likelihood-ratio-approach-for-probabilistic","title":"A Likelihood Ratio Approach for Probabilistic Inequalities","date":"2013-08-18","arxiv_id":"1308.4123","repositories_listed":0,"syntology":null},{"url":null,"slug":"high-dimensional-sparse-gaussian-graphical","title":"High dimensional Sparse Gaussian Graphical Mixture Model","date":"2013-08-15","arxiv_id":"1308.3381","repositories_listed":0,"syntology":null},{"url":null,"slug":"mixtures-of-common-skew-t-factor-analyzers","title":"Mixtures of Common Skew-t Factor Analyzers","date":"2013-07-21","arxiv_id":"1307.5558","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-line-bayesian-parameter-estimation-in","title":"On-line Bayesian parameter estimation in general non-linear state-space models: A tutorial and new results","date":"2013-07-12","arxiv_id":"1307.3490","repositories_listed":0,"syntology":null},{"url":null,"slug":"accuracy-of-map-segmentation-with-hidden","title":"Accuracy of MAP segmentation with hidden Potts and Markov mesh prior models via Path Constrained Viterbi Training, Iterated Conditional Modes and Graph Cut based algorithms","date":"2013-07-11","arxiv_id":"1307.2971","repositories_listed":0,"syntology":null},{"url":null,"slug":"loss-minimization-and-parameter-estimation","title":"Loss minimization and parameter estimation with heavy tails","date":"2013-07-07","arxiv_id":"1307.1827","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-direct-estimation-of-high-dimensional","title":"A Direct Estimation of High Dimensional Stationary Vector Autoregressions","date":"2013-07-01","arxiv_id":"1307.0293","repositories_listed":0,"syntology":null},{"url":null,"slug":"constrained-optimization-for-a-subset-of-the","title":"Constrained Optimization for a Subset of the Gaussian Parsimonious Clustering Models","date":"2013-06-25","arxiv_id":"1306.5824","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":"relaxed-sparse-eigenvalue-conditions-for","title":"Relaxed Sparse Eigenvalue Conditions for Sparse Estimation via Non-convex Regularized Regression","date":"2013-06-14","arxiv_id":"1306.3343","repositories_listed":0,"syntology":null},{"url":null,"slug":"confidence-intervals-and-hypothesis-testing","title":"Confidence Intervals and Hypothesis Testing for High-Dimensional Regression","date":"2013-06-13","arxiv_id":"1306.3171","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-encode-motion-using-spatio","title":"Learning to encode motion using spatio-temporal synchrony","date":"2013-06-13","arxiv_id":"1306.3162","repositories_listed":0,"syntology":null},{"url":null,"slug":"flexible-sampling-of-discrete-data","title":"Flexible sampling of discrete data correlations without the marginal distributions","date":"2013-06-12","arxiv_id":"1306.2685","repositories_listed":0,"syntology":null},{"url":null,"slug":"discriminative-parameter-estimation-for","title":"Discriminative Parameter Estimation for Random Walks Segmentation: Technical Report","date":"2013-06-05","arxiv_id":"1306.1083","repositories_listed":0,"syntology":null},{"url":null,"slug":"particle-approximations-of-the-score-and","title":"Particle approximations of the score and observed information matrix for parameter estimation in state space models with linear computational cost","date":"2013-06-04","arxiv_id":"1306.0735","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-fast-approximate-aib-algorithm-for","title":"A Fast Approximate AIB Algorithm for Distributional Word Clustering","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"parameter-estimation-for-lda-frames","title":"Parameter Estimation for LDA-Frames","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"affine-invariant-divergences-associated-with","title":"Affine Invariant Divergences associated with Composite Scores and its Applications","date":"2013-05-11","arxiv_id":"1305.2473","repositories_listed":0,"syntology":null},{"url":null,"slug":"calibrated-multivariate-regression-with","title":"Calibrated Multivariate Regression with Application to Neural Semantic Basis Discovery","date":"2013-05-10","arxiv_id":"1305.2238","repositories_listed":0,"syntology":null},{"url":null,"slug":"inference-in-kingmans-coalescent-with","title":"Inference in Kingman's Coalescent with Particle Markov Chain Monte Carlo Method","date":"2013-05-03","arxiv_id":"1305.0855","repositories_listed":0,"syntology":null},{"url":null,"slug":"inferring-ground-truth-from-multi-annotator","title":"Inferring ground truth from multi-annotator ordinal data: a probabilistic approach","date":"2013-04-30","arxiv_id":"1305.0015","repositories_listed":0,"syntology":null},{"url":null,"slug":"inference-and-learning-in-probabilistic-logic","title":"Inference and learning in probabilistic logic programs using weighted Boolean formulas","date":"2013-04-25","arxiv_id":"1304.6810","repositories_listed":0,"syntology":null},{"url":null,"slug":"marginal-likelihoods-for-distributed","title":"Marginal Likelihoods for Distributed Parameter Estimation of Gaussian Graphical Models","date":"2013-03-19","arxiv_id":"1303.4756","repositories_listed":0,"syntology":null},{"url":null,"slug":"estimation-stability-with-cross-validation","title":"Estimation Stability with Cross Validation (ESCV)","date":"2013-03-13","arxiv_id":"1303.3128","repositories_listed":0,"syntology":null},{"url":null,"slug":"13012266","title":"Variational MCMC","date":"2013-01-10","arxiv_id":"1301.2266","repositories_listed":0,"syntology":null},{"url":null,"slug":"approximate-message-passing-with-consistent","title":"Approximate Message Passing with Consistent Parameter Estimation and Applications to Sparse Learning","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"forward-backward-activation-algorithm-for","title":"Forward-Backward Activation Algorithm for Hierarchical Hidden Markov Models","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"latent-coincidence-analysis-a-hidden-variable","title":"Latent Coincidence Analysis: A Hidden Variable Model for Distance Metric Learning","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-stage-multi-task-feature-learning","title":"Multi-Stage Multi-Task Feature Learning","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"record_sha256":"ecfb48e42e324309d31152941a4593ca2254cd7c826fd64b5fe4507d0760fd10","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}