{"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/regression-1/papers/94","list_of":"/task/regression-1","task":"regression","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":94,"pages_in_order":95,"rows_per_page":100,"rows":[9301,9400],"of":9424,"counts":{"archive_papers_tagged":9424,"with_a_code_link":2445,"where_syntology_ran_a_sample":449,"not_listed_spam_title":0,"listed":9424,"listed_where_code_ran":449,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":374,"every_run_a_failure_of_syntologys_instrument":75,"listed_with_a_run_with_no_instrument_failure":374,"listed_every_run_a_failure_of_syntologys_instrument":75,"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/regression-1","prev":"/task/regression-1/papers/93","next":"/task/regression-1/papers/95","papers":[{"url":null,"slug":"efficient-regularized-least-squares","title":"Efficient Regularized Least-Squares Algorithms for Conditional Ranking on Relational Data","date":"2012-09-21","arxiv_id":"1209.4825","repositories_listed":0,"syntology":null},{"url":null,"slug":"regression-trees-for-longitudinal-and","title":"Regression trees for longitudinal and multiresponse data","date":"2012-09-21","arxiv_id":"1209.4690","repositories_listed":0,"syntology":null},{"url":null,"slug":"comunication-efficient-algorithms-for","title":"Comunication-Efficient Algorithms for Statistical Optimization","date":"2012-09-19","arxiv_id":"1209.4129","repositories_listed":0,"syntology":null},{"url":null,"slug":"group-descent-algorithms-for-nonconvex","title":"Group descent algorithms for nonconvex penalized linear and logistic regression models with grouped predictors","date":"2012-09-10","arxiv_id":"1209.2160","repositories_listed":0,"syntology":null},{"url":null,"slug":"consistent-selection-of-tuning-parameters-via","title":"Consistent selection of tuning parameters via variable selection stability","date":"2012-08-16","arxiv_id":"1208.3380","repositories_listed":0,"syntology":null},{"url":null,"slug":"sharp-analysis-of-low-rank-kernel-matrix","title":"Sharp analysis of low-rank kernel matrix approximations","date":"2012-08-09","arxiv_id":"1208.2015","repositories_listed":0,"syntology":null},{"url":null,"slug":"gaussian-process-regression-as-a-predictive","title":"Gaussian process regression as a predictive model for Quality-of-Service in Web service systems","date":"2012-07-30","arxiv_id":"1207.6910","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-fast-cauchy-transform-and-faster-robust","title":"The Fast Cauchy Transform and Faster Robust Linear Regression","date":"2012-07-19","arxiv_id":"1207.4684","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-regression-based-approach-to-modeling","title":"A Regression-based Approach to Modeling Addressee Backchannels","date":"2012-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"deeppurple-estimating-sentence-semantic","title":"DeepPurple: Estimating Sentence Semantic Similarity using N-gram Regression Models and Web Snippets","date":"2012-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"probabilistic-finite-state-machines-for","title":"Probabilistic Finite State Machines for Regression-based MT Evaluation","date":"2012-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"unitor-combining-semantic-text-similarity","title":"UNITOR: Combining Semantic Text Similarity functions through SV Regression","date":"2012-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-simple-algorithm-for-semi-supervised","title":"A Simple Algorithm for Semi-supervised Learning with Improved Generalization Error Bound","date":"2012-06-27","arxiv_id":"1206.6412","repositories_listed":0,"syntology":null},{"url":null,"slug":"improved-information-gain-estimates-for","title":"Improved Information Gain Estimates for Decision Tree Induction","date":"2012-06-18","arxiv_id":"1206.4620","repositories_listed":0,"syntology":null},{"url":null,"slug":"orthogonal-matching-pursuit-with-noisy-and","title":"Orthogonal Matching Pursuit with Noisy and Missing Data: Low and High Dimensional Results","date":"2012-06-05","arxiv_id":"1206.0823","repositories_listed":0,"syntology":null},{"url":null,"slug":"regression-with-phrase-indicators-for","title":"Regression with Phrase Indicators for Estimating MT Quality","date":"2012-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"tuning-as-linear-regression","title":"Tuning as Linear Regression","date":"2012-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-generalized-kernel-approach-to-structured","title":"A Generalized Kernel Approach to Structured Output Learning","date":"2012-05-10","arxiv_id":"1205.2171","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-power-law-kernels-corresponding","title":"On Power-law Kernels, corresponding Reproducing Kernel Hilbert Space and Applications","date":"2012-04-09","arxiv_id":"1204.1800","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-multi-objective-exploratory-procedure-for","title":"A Multi-objective Exploratory Procedure for Regression Model Selection","date":"2012-03-28","arxiv_id":"1203.6276","repositories_listed":0,"syntology":null},{"url":null,"slug":"algorithms-for-learning-kernels-based-on","title":"Algorithms for Learning Kernels Based on Centered Alignment","date":"2012-03-02","arxiv_id":"1203.0550","repositories_listed":0,"syntology":null},{"url":null,"slug":"near-optimal-coresets-for-least-squares","title":"Near-optimal Coresets For Least-Squares Regression","date":"2012-02-16","arxiv_id":"1202.3505","repositories_listed":0,"syntology":null},{"url":null,"slug":"lossy-compression-via-sparse-linear-1","title":"Lossy Compression via Sparse Linear Regression: Performance under Minimum-distance Encoding","date":"2012-02-03","arxiv_id":"1202.0840","repositories_listed":0,"syntology":null},{"url":null,"slug":"kernels-on-sample-sets-via-nonparametric","title":"Kernels on Sample Sets via Nonparametric Divergence Estimates","date":"2012-02-01","arxiv_id":"1202.0302","repositories_listed":0,"syntology":null},{"url":null,"slug":"continuous-time-regression-models-for","title":"Continuous-Time Regression Models for Longitudinal Networks","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"convergent-fitted-value-iteration-with-linear","title":"Convergent Fitted Value Iteration with Linear Function Approximation","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-learning-of-generalized-linear-and","title":"Efficient Learning of Generalized Linear and Single Index Models with Isotonic Regression","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"gaussian-process-training-with-input-noise","title":"Gaussian Process Training with Input Noise","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"generalized-beta-mixtures-of-gaussians","title":"Generalized Beta Mixtures of Gaussians","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"high-dimensional-regression-with-noisy-and","title":"High-dimensional regression with noisy and missing data: Provable guarantees with non-convexity","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"k-nn-regression-adapts-to-local-intrinsic","title":"k-NN Regression Adapts to Local Intrinsic Dimension","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-patient-specific-cancer-survival","title":"Learning Patient-Specific Cancer Survival Distributions as a Sequence of Dependent Regressors","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"non-asymptotic-analysis-of-stochastic","title":"Non-Asymptotic Analysis of Stochastic Approximation Algorithms for Machine Learning","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"non-conjugate-variational-message-passing-for","title":"Non-conjugate Variational Message Passing for Multinomial and Binary Regression","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-causal-discovery-with-cyclic-additive","title":"On Causal Discovery with Cyclic Additive Noise Models","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-learning-rates-for-least-squares-svms","title":"Optimal learning rates for least squares SVMs using Gaussian kernels","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"projection-onto-a-nonnegative-max-heap","title":"Projection onto A Nonnegative Max-Heap","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"regularized-laplacian-estimation-and-fast","title":"Regularized Laplacian Estimation and Fast Eigenvector Approximation","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"semi-supervised-regression-via-parallel-field","title":"Semi-supervised Regression via Parallel Field Regularization","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-bayesian-multi-task-learning","title":"Sparse Bayesian Multi-Task Learning","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-features-for-pca-like-linear","title":"Sparse Features for PCA-Like Linear Regression","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-recovery-by-thresholded-non-negative","title":"Sparse recovery by thresholded non-negative least squares","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"statistical-tests-for-optimization-efficiency","title":"Statistical Tests for Optimization Efficiency","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-regression-in-metric-spaces-via","title":"Efficient Regression in Metric Spaces via Approximate Lipschitz Extension","date":"2011-11-18","arxiv_id":"1111.4470","repositories_listed":0,"syntology":null},{"url":null,"slug":"regression-for-sets-of-polynomial-equations","title":"Regression for sets of polynomial equations","date":"2011-10-20","arxiv_id":"1110.4531","repositories_listed":0,"syntology":null},{"url":null,"slug":"overlapping-mixtures-of-gaussian-processes","title":"Overlapping Mixtures of Gaussian Processes for the Data Association Problem","date":"2011-08-16","arxiv_id":"1108.3372","repositories_listed":0,"syntology":null},{"url":null,"slug":"random-design-analysis-of-ridge-regression","title":"Random design analysis of ridge regression","date":"2011-06-13","arxiv_id":"1106.2363","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-and-optimal-online-linear-regression","title":"Adaptive and optimal online linear regression on $\\ell^1$-balls","date":"2011-05-20","arxiv_id":"1105.4042","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-risk-comparison-of-ordinary-least-squares","title":"A Risk Comparison of Ordinary Least Squares vs Ridge Regression","date":"2011-05-04","arxiv_id":"1105.0875","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparsity-regret-bounds-for-individual","title":"Sparsity regret bounds for individual sequences in online linear regression","date":"2011-01-05","arxiv_id":"1101.1057","repositories_listed":0,"syntology":null},{"url":null,"slug":"software-effort-estimation-with-ridge","title":"Software Effort Estimation with Ridge Regression and Evolutionary Attribute Selection","date":"2010-12-28","arxiv_id":"1012.5754","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-dirty-model-for-multi-task-learning","title":"A Dirty Model for Multi-task Learning","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-family-of-penalty-functions-for-structured","title":"A Family of Penalty Functions for Structured Sparsity","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-multi-task-lasso-with-application-to","title":"Adaptive Multi-Task Lasso: with Application to eQTL Detection","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"block-variable-selection-in-multivariate","title":"Block Variable Selection in Multivariate Regression and High-dimensional Causal Inference","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"decomposing-isotonic-regression-for","title":"Decomposing Isotonic Regression for Efficiently Solving Large Problems","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"discriminative-clustering-by-regularized","title":"Discriminative Clustering by Regularized Information Maximization","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-and-robust-feature-selection-via","title":"Efficient and Robust Feature Selection via Joint ℓ2,1-Norms Minimization","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"exact-learning-curves-for-gaussian-process","title":"Exact learning curves for Gaussian process regression on large random graphs","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-global-convergence-rates-of-gradient","title":"Fast global convergence rates of gradient methods for high-dimensional statistical recovery","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-valued-regression","title":"Graph-Valued Regression","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"heavy-tailed-process-priors-for-selective","title":"Heavy-Tailed Process Priors for Selective Shrinkage","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"implicitly-constrained-gaussian-process","title":"Implicitly Constrained Gaussian Process Regression for Monocular Non-Rigid Pose Estimation","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"multivariate-dyadic-regression-trees-for","title":"Multivariate Dyadic Regression Trees for Sparse Learning Problems","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-learning-rates-for-kernel-conjugate","title":"Optimal learning rates for Kernel Conjugate Gradient regression","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"penalized-principal-component-regression-on","title":"Penalized Principal Component Regression on Graphs for Analysis of Subnetworks","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"pose-sensitive-embedding-by-nonlinear-nca","title":"Pose-Sensitive Embedding by Nonlinear NCA Regression","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"predicting-execution-time-of-computer","title":"Predicting Execution Time of Computer Programs Using Sparse Polynomial Regression","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"relaxed-clipping-a-global-training-method-for","title":"Relaxed Clipping: A Global Training Method for Robust Regression and Classification","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"scrambled-objects-for-least-squares","title":"Scrambled Objects for Least-Squares Regression","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"t-logistic-regression","title":"t-logistic regression","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"nuclear-norm-penalization-and-optimal-rates","title":"Nuclear norm penalization and optimal rates for noisy low rank matrix completion","date":"2010-11-29","arxiv_id":"1011.6256","repositories_listed":0,"syntology":null},{"url":null,"slug":"bregman-distance-to-l1-regularized-logistic","title":"Bregman Distance to L1 Regularized Logistic Regression","date":"2010-04-21","arxiv_id":"1004.3814","repositories_listed":0,"syntology":null},{"url":null,"slug":"augmenting-feature-driven-fmri-analyses-semi","title":"Augmenting Feature-driven fMRI Analyses: Semi-supervised learning and resting state activity","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"compressed-least-squares-regression","title":"Compressed Least-Squares Regression","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"convex-relaxation-of-mixture-regression-with","title":"Convex Relaxation of Mixture Regression with Efficient Algorithms","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"data-driven-calibration-of-linear-estimators","title":"Data-driven calibration of linear estimators with minimal penalties","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"directed-regression","title":"Directed Regression","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"distribution-matching-for-transduction","title":"Distribution Matching for Transduction","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"ensemble-nystrom-method","title":"Ensemble Nystrom Method","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-smooth-and-adaptive-regression-in-metric","title":"Fast, smooth and adaptive regression in metric spaces","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"from-pac-bayes-bounds-to-kl-regularization","title":"From PAC-Bayes Bounds to KL Regularization","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"gaussian-process-regression-with-student-t","title":"Gaussian process regression with Student-t likelihood","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-errors-and-learning-curves-for","title":"Generalization Errors and Learning Curves for Regression with Multi-task Gaussian Processes","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"grouped-orthogonal-matching-pursuit-for","title":"Grouped Orthogonal Matching Pursuit for Variable Selection and Prediction","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"heterogeneous-multitask-learning-with-joint","title":"Heterogeneous multitask learning with joint sparsity constraints","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"kernels-and-learning-curves-for-gaussian","title":"Kernels and learning curves for Gaussian process regression on random graphs","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"lattice-regression","title":"Lattice Regression","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-non-linear-combinations-of-kernels","title":"Learning Non-Linear Combinations of Kernels","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"lower-bounds-on-minimax-rates-for","title":"Lower bounds on minimax rates for nonparametric regression with additive sparsity and smoothness","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"manifold-regularization-for-sir-with-rate","title":"Manifold Regularization for SIR with Rate Root-n Convergence","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"nonparametric-greedy-algorithms-for-the","title":"Nonparametric Greedy Algorithms for the Sparse Learning Problem","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-scoring-for-unsupervised-learning","title":"Optimal Scoring for Unsupervised Learning","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-nonparametric-regression-with-metric","title":"Robust Nonparametric Regression with Metric-Space Valued Output","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"semi-supervised-regression-using-hessian","title":"Semi-supervised Regression using Hessian energy with an application to semi-supervised dimensionality reduction","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"structured-output-regression-for-detection","title":"Structured output regression for detection with partial truncation","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"effectiveness-and-limitations-of-statistical","title":"Effectiveness and Limitations of Statistical Spam Filters","date":"2009-10-14","arxiv_id":"0910.2540","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparsistent-estimation-of-time-varying","title":"Sparsistent Estimation of Time-Varying Discrete Markov Random Fields","date":"2009-07-14","arxiv_id":"0907.2337","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-homotopy-algorithm-for-the-lasso-with","title":"An Homotopy Algorithm for the Lasso with Online Observations","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-kernel-shaping-for-learning-control","title":"Bayesian Kernel Shaping for Learning Control","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"record_sha256":"57f8253804e9fcbcc221358514b2aeb69bfc6f263e57dbc59b77306f803150a8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}