{"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/matrix-completion/papers/4","list_of":"/task/matrix-completion","task":"Matrix Completion","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":4,"pages_in_order":8,"rows_per_page":100,"rows":[301,400],"of":796,"counts":{"archive_papers_tagged":796,"with_a_code_link":153,"where_syntology_ran_a_sample":16,"not_listed_spam_title":0,"listed":796,"listed_where_code_ran":16,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":15,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":15,"listed_every_run_a_failure_of_syntologys_instrument":1,"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/matrix-completion","prev":"/task/matrix-completion/papers/3","next":"/task/matrix-completion/papers/5","papers":[{"url":null,"slug":"geometric-matrix-completion-via-sylvester","title":"Geometric Matrix Completion via Sylvester Multi-Graph Neural Network","date":"2022-06-19","arxiv_id":"2206.09477","repositories_listed":0,"syntology":null},{"url":null,"slug":"multiearth-2022-the-champion-solution-for-the","title":"MultiEarth 2022 -- The Champion Solution for the Matrix Completion Challenge via Multimodal Regression and Generation","date":"2022-06-17","arxiv_id":"2206.08970","repositories_listed":0,"syntology":null},{"url":null,"slug":"introducing-the-huber-mechanism-for","title":"Introducing the Huber mechanism for differentially private low-rank matrix completion","date":"2022-06-16","arxiv_id":"2206.07910","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-matrix-completion-with-heavy-tailed","title":"Robust Matrix Completion with Heavy-tailed Noise","date":"2022-06-09","arxiv_id":"2206.04276","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-majorization-minimization-algorithm-for-1","title":"A majorization-minimization algorithm for nonnegative binary matrix factorization","date":"2022-04-20","arxiv_id":"2204.09741","repositories_listed":0,"syntology":null},{"url":null,"slug":"quaternion-optimized-model-with-sparse","title":"Quaternion Optimized Model with Sparse Regularization for Color Image Recovery","date":"2022-04-19","arxiv_id":"2204.08629","repositories_listed":0,"syntology":null},{"url":null,"slug":"multiearth-2022-multimodal-learning-for-earth","title":"MultiEarth 2022 -- Multimodal Learning for Earth and Environment Workshop and Challenge","date":"2022-04-15","arxiv_id":"2204.07649","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-completion-with-sparse-noisy-rows","title":"Matrix Completion with Sparse Noisy Rows","date":"2022-04-01","arxiv_id":"2204.01530","repositories_listed":0,"syntology":null},{"url":null,"slug":"survey-of-matrix-completion-algorithms","title":"Survey of Matrix Completion Algorithms","date":"2022-04-01","arxiv_id":"2204.01532","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-completion-with-heterogonous-cost","title":"Matrix Completion with Heterogonous Cost","date":"2022-03-23","arxiv_id":"2203.12120","repositories_listed":0,"syntology":null},{"url":null,"slug":"perturbation-analysis-of-randomized-svd-and","title":"Perturbation Analysis of Randomized SVD and its Applications to Statistics","date":"2022-03-19","arxiv_id":"2203.10262","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-low-rank-matrix-completion-with-dual","title":"Bayesian Low-rank Matrix Completion with Dual-graph Embedding: Prior Analysis and Tuning-free Inference","date":"2022-03-18","arxiv_id":"2203.10044","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-noisy-matrix-completion","title":"Adaptive Noisy Matrix Completion","date":"2022-03-16","arxiv_id":"2203.08340","repositories_listed":0,"syntology":null},{"url":null,"slug":"hierarchical-clustering-and-matrix-completion","title":"Hierarchical Clustering and Matrix Completion for the Reconstruction of World Input-Output Tables","date":"2022-03-16","arxiv_id":"2203.08819","repositories_listed":0,"syntology":null},{"url":null,"slug":"lifelong-matrix-completion-with-sparsity","title":"Lifelong Matrix Completion with Sparsity-Number","date":"2022-03-15","arxiv_id":"2203.07637","repositories_listed":0,"syntology":null},{"url":null,"slug":"flat-minima-generalize-for-low-rank-matrix","title":"Flat minima generalize for low-rank matrix recovery","date":"2022-03-07","arxiv_id":"2203.03756","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-completion-via-non-convex-relaxation","title":"Matrix Completion via Non-Convex Relaxation and Adaptive Correlation Learning","date":"2022-03-04","arxiv_id":"2203.02189","repositories_listed":0,"syntology":null},{"url":null,"slug":"high-dimensional-statistical-estimation-under","title":"High Dimensional Statistical Estimation under Uniformly Dithered One-bit Quantization","date":"2022-02-26","arxiv_id":"2202.13157","repositories_listed":0,"syntology":null},{"url":null,"slug":"confidence-intervals-of-treatment-effects-in","title":"Confidence Intervals of Treatment Effects in Panel Data Models with Interactive Fixed Effects","date":"2022-02-24","arxiv_id":"2202.12078","repositories_listed":0,"syntology":null},{"url":null,"slug":"two-snapshot-doa-estimation-via-hankel","title":"Two-snapshot DOA Estimation via Hankel-structured Matrix Completion","date":"2022-02-21","arxiv_id":"2202.10148","repositories_listed":0,"syntology":null},{"url":null,"slug":"splitting-numerical-integration-for-matrix","title":"Splitting numerical integration for matrix completion","date":"2022-02-14","arxiv_id":"2202.06482","repositories_listed":0,"syntology":null},{"url":null,"slug":"color-image-inpainting-via-robust-pure","title":"Color Image Inpainting via Robust Pure Quaternion Matrix Completion: Error Bound and Weighted Loss","date":"2022-02-04","arxiv_id":"2202.02063","repositories_listed":0,"syntology":null},{"url":null,"slug":"lrsvrg-imc-an-svrg-based-algorithm-for","title":"LRSVRG-IMC: An SVRG-Based Algorithm for LowRank Inductive Matrix Completion","date":"2022-01-21","arxiv_id":"2201.08516","repositories_listed":0,"syntology":null},{"url":null,"slug":"dense-air-quality-maps-using-regressive","title":"Dense Air Quality Maps Using Regressive Facility Location Based Drive By Sensing","date":"2022-01-20","arxiv_id":"2201.09739","repositories_listed":0,"syntology":null},{"url":null,"slug":"variational-bayesian-filtering-with-subspace","title":"Variational Bayesian Filtering with Subspace Information for Extreme Spatio-Temporal Matrix Completion","date":"2022-01-20","arxiv_id":"2201.08307","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-completion-with-hierarchical-graph-1","title":"Matrix Completion with Hierarchical Graph Side Information","date":"2022-01-02","arxiv_id":"2201.01728","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-asymptotic-linear-convergence-of-projected","title":"On Asymptotic Linear Convergence of Projected Gradient Descent for Constrained Least Squares","date":"2021-12-22","arxiv_id":"2112.11760","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-more-stable-accelerated-gradient-method","title":"A More Stable Accelerated Gradient Method Inspired by Continuous-Time Perspective","date":"2021-12-09","arxiv_id":"2112.04922","repositories_listed":0,"syntology":null},{"url":null,"slug":"fine-grained-generalization-analysis-of-2","title":"Fine-grained Generalization Analysis of Inductive Matrix Completion","date":"2021-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"pac-bayesian-matrix-completion-with-a","title":"PAC-Bayesian matrix completion with a spectral scaled Student prior","date":"2021-11-22","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-low-rank-matrix-factorization-based","title":"Efficient Low-Rank Matrix Factorization based on l1,ε-norm for Online Background Subtraction","date":"2021-11-19","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"consistent-estimation-for-pca-and-sparse","title":"Consistent Estimation for PCA and Sparse Regression with Oblivious Outliers","date":"2021-11-04","arxiv_id":"2111.02966","repositories_listed":0,"syntology":null},{"url":null,"slug":"projection-free-algorithm-for-stochastic-bi","title":"Projection-Free Algorithm for Stochastic Bi-level Optimization","date":"2021-10-22","arxiv_id":"2110.11721","repositories_listed":0,"syntology":null},{"url":null,"slug":"uncertainty-quantification-for-low-rank","title":"Uncertainty Quantification For Low-Rank Matrix Completion With Heterogeneous and Sub-Exponential Noise","date":"2021-10-22","arxiv_id":"2110.12046","repositories_listed":0,"syntology":null},{"url":null,"slug":"computational-graph-completion","title":"Computational Graph Completion","date":"2021-10-20","arxiv_id":"2110.10323","repositories_listed":0,"syntology":null},{"url":null,"slug":"reconstruction-of-fragmented-trajectories-of","title":"Reconstruction of Fragmented Trajectories of Collective Motion using Hadamard Deep Autoencoders","date":"2021-10-20","arxiv_id":"2110.10428","repositories_listed":0,"syntology":null},{"url":null,"slug":"factorization-approach-for-low-complexity","title":"Factorization Approach for Low-complexity Matrix Completion Problems: Exponential Number of Spurious Solutions and Failure of Gradient Methods","date":"2021-10-19","arxiv_id":"2110.10279","repositories_listed":0,"syntology":null},{"url":null,"slug":"one-bit-matrix-completion-with-differential","title":"One-Bit Matrix Completion with Differential Privacy","date":"2021-10-02","arxiv_id":"2110.00719","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-way-clustering-and-discordance-analysis","title":"Multi-way Clustering and Discordance Analysis through Deep Collective Matrix Tri-Factorization","date":"2021-09-27","arxiv_id":"2109.13164","repositories_listed":0,"syntology":null},{"url":null,"slug":"provable-low-rank-plus-sparse-matrix","title":"Provable Low Rank Plus Sparse Matrix Separation Via Nonconvex Regularizers","date":"2021-09-26","arxiv_id":"2109.12713","repositories_listed":0,"syntology":null},{"url":null,"slug":"weighted-low-rank-matrix-approximation-and","title":"Weighted Low Rank Matrix Approximation and Acceleration","date":"2021-09-22","arxiv_id":"2109.11057","repositories_listed":0,"syntology":null},{"url":null,"slug":"accelerated-stochastic-gradient-for","title":"Accelerated Stochastic Gradient for Nonnegative Tensor Completion and Parallel Implementation","date":"2021-09-20","arxiv_id":"2109.09534","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-fundamental-limits-of-matrix","title":"On the Fundamental Limits of Matrix Completion: Leveraging Hierarchical Similarity Graphs","date":"2021-09-12","arxiv_id":"2109.05408","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-completion-of-world-trade","title":"Matrix Completion of World Trade","date":"2021-09-08","arxiv_id":"2109.03930","repositories_listed":0,"syntology":null},{"url":null,"slug":"provable-tensor-train-format-tensor","title":"Provable Tensor-Train Format Tensor Completion by Riemannian Optimization","date":"2021-08-27","arxiv_id":"2108.12163","repositories_listed":0,"syntology":null},{"url":null,"slug":"attribute-based-explanations-of-non-linear","title":"Attribute-based Explanations of Non-Linear Embeddings of High-Dimensional Data","date":"2021-07-28","arxiv_id":"2108.08706","repositories_listed":0,"syntology":null},{"url":null,"slug":"private-alternating-least-squares-practical","title":"Private Alternating Least Squares: Practical Private Matrix Completion with Tighter Rates","date":"2021-07-20","arxiv_id":"2107.09802","repositories_listed":0,"syntology":null},{"url":null,"slug":"causal-inference-with-corrupted-data","title":"Causal Inference with Corrupted Data: Measurement Error, Missing Values, Discretization, and Differential Privacy","date":"2021-07-06","arxiv_id":"2107.02780","repositories_listed":0,"syntology":null},{"url":null,"slug":"low-rank-quaternion-matrix-recovery-via","title":"Low Rank Quaternion Matrix Recovery via Logarithmic Approximation","date":"2021-07-03","arxiv_id":"2107.01380","repositories_listed":0,"syntology":null},{"url":null,"slug":"global-convergence-of-gradient-descent-for-1","title":"Global Convergence of Gradient Descent for Asymmetric Low-Rank Matrix Factorization","date":"2021-06-27","arxiv_id":"2106.14289","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-completion-with-model-free-weighting","title":"Matrix Completion with Model-free Weighting","date":"2021-06-09","arxiv_id":"2106.05850","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-pre-training-oracle-for-predicting","title":"A Pre-training Oracle for Predicting Distances in Social Networks","date":"2021-06-06","arxiv_id":"2106.03233","repositories_listed":0,"syntology":null},{"url":null,"slug":"non-local-patch-based-low-rank-tensor-ring","title":"Patch Tracking-based Streaming Tensor Ring Completion for Visual Data Recovery","date":"2021-05-30","arxiv_id":"2105.14620","repositories_listed":0,"syntology":null},{"url":null,"slug":"belt-blockwise-missing-embedding-learning","title":"Multi-source Learning via Completion of Block-wise Overlapping Noisy Matrices","date":"2021-05-21","arxiv_id":"2105.10360","repositories_listed":0,"syntology":null},{"url":null,"slug":"sharp-restricted-isometry-property-bounds-for","title":"Sharp Restricted Isometry Property Bounds for Low-rank Matrix Recovery Problems with Corrupted Measurements","date":"2021-05-18","arxiv_id":"2105.08232","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-learned-svt-unrolling-singular-value","title":"Deep learned SVT: Unrolling singular value thresholding to obtain better MSE","date":"2021-05-14","arxiv_id":"2105.06934","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-optimality-of-nuclear-norm-based","title":"On the Optimality of Nuclear-norm-based Matrix Completion for Problems with Smooth Non-linear Structure","date":"2021-05-05","arxiv_id":"2105.01874","repositories_listed":0,"syntology":null},{"url":null,"slug":"implicit-regularization-in-deep-tensor","title":"Implicit Regularization in Deep Tensor Factorization","date":"2021-05-04","arxiv_id":"2105.01346","repositories_listed":0,"syntology":null},{"url":null,"slug":"nonparametric-trace-regression-in-high","title":"Nonparametric Trace Regression in High Dimensions via Sign Series Representation","date":"2021-05-04","arxiv_id":"2105.01783","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-completion-based-on-gaussian-belief","title":"Matrix completion based on Gaussian parameterized belief propagation","date":"2021-05-01","arxiv_id":"2105.00233","repositories_listed":0,"syntology":null},{"url":null,"slug":"automated-problem-setting-selection-in-multi","title":"Multi-target prediction for dummies using two-branch neural networks","date":"2021-04-19","arxiv_id":"2104.09967","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-matrix-completion-with-a-spectral","title":"PAC-Bayesian Matrix Completion with a Spectral Scaled Student Prior","date":"2021-04-16","arxiv_id":"2104.08191","repositories_listed":0,"syntology":null},{"url":null,"slug":"joint-matrix-completion-and-compressed","title":"Joint Matrix Completion and Compressed Sensing for State Estimation in Low-observable Distribution System","date":"2021-04-13","arxiv_id":"2104.06470","repositories_listed":0,"syntology":null},{"url":null,"slug":"structure-preserving-progressive-low-rank","title":"Structure-Preserving Progressive Low-rank Image Completion for Defending Adversarial Attacks","date":"2021-03-04","arxiv_id":"2103.02781","repositories_listed":0,"syntology":null},{"url":null,"slug":"progresses-and-challenges-in-link-prediction","title":"Progresses and Challenges in Link Prediction","date":"2021-02-23","arxiv_id":"2102.11472","repositories_listed":0,"syntology":null},{"url":null,"slug":"forecasting-nonnegative-time-series-via","title":"Forecasting Nonnegative Time Series via Sliding Mask Method (SMM) and Latent Clustered Forecast (LCF)","date":"2021-02-10","arxiv_id":"2102.05314","repositories_listed":0,"syntology":null},{"url":null,"slug":"wasserstein-diffusion-on-graphs-with-missing-1","title":"Wasserstein Graph Neural Networks for Graphs with Missing Attributes","date":"2021-02-06","arxiv_id":"2102.03450","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-decomposition-on-graphs-a-functional","title":"Matrix Decomposition on Graphs: A Functional View","date":"2021-02-05","arxiv_id":"2102.03233","repositories_listed":0,"syntology":null},{"url":null,"slug":"exact-linear-convergence-rate-analysis-for","title":"Exact Linear Convergence Rate Analysis for Low-Rank Symmetric Matrix Completion via Gradient Descent","date":"2021-02-04","arxiv_id":"2102.02396","repositories_listed":0,"syntology":null},{"url":null,"slug":"riemannian-perspective-on-matrix","title":"Riemannian Perspective on Matrix Factorization","date":"2021-02-01","arxiv_id":"2102.00937","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-array-beamformer-design-for-active-and","title":"Sparse Array Beamformer Design for Active and Passive Sensing","date":"2021-01-18","arxiv_id":"2101.06816","repositories_listed":0,"syntology":null},{"url":null,"slug":"local-search-algorithms-for-rank-constrained-1","title":"Local Search Algorithms for Rank-Constrained Convex Optimization","date":"2021-01-15","arxiv_id":"2101.06262","repositories_listed":0,"syntology":null},{"url":null,"slug":"estimation-of-missing-data-in-intelligent","title":"Estimation of Missing Data in Intelligent Transportation System","date":"2021-01-09","arxiv_id":"2101.03295","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-new-accelerated-gradient-method-inspired-by","title":"A new accelerated gradient method inspired by continuous-time perspective","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"inductive-collaborative-filtering-via","title":"Inductive Collaborative Filtering via Relation Graph Learning","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-data-deep-decoder-geometric-learning","title":"Matrix Data Deep Decoder - Geometric Learning for Structured Data Completion","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-learning-approach-for-matrix-completion","title":"Deep Learning Approach for Matrix Completion Using Manifold Learning","date":"2020-12-11","arxiv_id":"2012.06063","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-generalised-log-determinant-regularizer-for","title":"A generalised log-determinant regularizer for online semi-definite programming and its applications","date":"2020-12-10","arxiv_id":"2012.05632","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-parameter-free-frank-wolfe-with-an","title":"Enhancing Parameter-Free Frank Wolfe with an Extra Subproblem","date":"2020-12-09","arxiv_id":"2012.05284","repositories_listed":0,"syntology":null},{"url":null,"slug":"conic-descent-and-its-application-to-memory","title":"Conic Descent and its Application to Memory-efficient Optimization over Positive Semidefinite Matrices","date":"2020-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"non-local-robust-quaternion-matrix-completion","title":"Non-Local Robust Quaternion Matrix Completion for Color Images and Videos Inpainting","date":"2020-11-17","arxiv_id":"2011.08675","repositories_listed":0,"syntology":null},{"url":null,"slug":"hamiltonian-q-learning-leveraging-importance-1","title":"On Using Hamiltonian Monte Carlo Sampling for Reinforcement Learning Problems in High-dimension","date":"2020-11-11","arxiv_id":"2011.05927","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-completion-with-noise-via-leveraged","title":"Leveraged Matrix Completion with Noise","date":"2020-11-11","arxiv_id":"2011.05885","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-array-beamforming-design-for-wideband","title":"Sparse Array Beamforming Design for Wideband Signal Models","date":"2020-11-04","arxiv_id":"2011.02115","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-robust-low-rank-matrix-estimation","title":"Adversarial Robust Low Rank Matrix Estimation: Compressed Sensing and Matrix Completion","date":"2020-10-25","arxiv_id":"2010.13018","repositories_listed":0,"syntology":null},{"url":null,"slug":"low-rank-approximations-of-nonseparable-panel","title":"Low-Rank Approximations of Nonseparable Panel Models","date":"2020-10-23","arxiv_id":"2010.12439","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimum-codesign-for-image-denoising-between","title":"Optimum Codesign for Image Denoising Between Type-2 Fuzzy Identifier and Matrix Completion Denoiser","date":"2020-10-13","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-convergence-of-langevin-dynamics-on","title":"Fast Convergence of Langevin Dynamics on Manifold: Geodesics meet Log-Sobolev","date":"2020-10-11","arxiv_id":"2010.05263","repositories_listed":0,"syntology":null},{"url":null,"slug":"recent-developments-on-factor-models-and-its","title":"Recent Developments on Factor Models and its Applications in Econometric Learning","date":"2020-09-21","arxiv_id":"2009.10103","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-of-nonnegative-data-and-an","title":"Clustering of Nonnegative Data and an Application to Matrix Completion","date":"2020-09-02","arxiv_id":"2009.01279","repositories_listed":0,"syntology":null},{"url":null,"slug":"low-rank-matrix-recovery-with-non-quadratic","title":"Low-rank matrix recovery with non-quadratic loss: projected gradient method and regularity projection oracle","date":"2020-08-31","arxiv_id":"2008.13777","repositories_listed":0,"syntology":null},{"url":null,"slug":"column-ell-20-norm-regularized-factorization","title":"Column $\\ell_{2,0}$-norm regularized factorization model of low-rank matrix recovery and its computation","date":"2020-08-24","arxiv_id":"2008.10466","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-low-rank-matrix-completion-via-an","title":"Robust Low-rank Matrix Completion via an Alternating Manifold Proximal Gradient Continuation Method","date":"2020-08-18","arxiv_id":"2008.07740","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-low-rank-matrix-learning-by","title":"A Scalable, Adaptive and Sound Nonconvex Regularizer for Low-rank Matrix Completion","date":"2020-08-14","arxiv_id":"2008.06542","repositories_listed":0,"syntology":null},{"url":null,"slug":"conservative-stochastic-optimization-with","title":"Conservative Stochastic Optimization with Expectation Constraints","date":"2020-08-13","arxiv_id":"2008.05758","repositories_listed":0,"syntology":null},{"url":null,"slug":"asymptotic-convergence-rate-of-alternating","title":"Asymptotic Convergence Rate of Alternating Minimization for Rank One Matrix Completion","date":"2020-08-11","arxiv_id":"2008.04988","repositories_listed":0,"syntology":null},{"url":null,"slug":"autoencoder-based-graph-construction-for-semi","title":"Autoencoder-based Graph Construction for Semi-supervised Learning","date":"2020-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"solving-the-phantom-inventory-problem-near","title":"Fixing Inventory Inaccuracies At Scale","date":"2020-06-23","arxiv_id":"2006.13126","repositories_listed":0,"syntology":null},{"url":null,"slug":"short-term-traffic-forecasting-using-high","title":"Short-Term Traffic Forecasting Using High-Resolution Traffic Data","date":"2020-06-22","arxiv_id":"2006.12292","repositories_listed":0,"syntology":null},{"url":null,"slug":"median-matrix-completion-from-embarrassment","title":"Median Matrix Completion: from Embarrassment to Optimality","date":"2020-06-18","arxiv_id":"2006.10400","repositories_listed":0,"syntology":null}],"record_sha256":"88b07ce2ff8a2dbec0efcc1d18e5ce6cfb8d8cfbaa6391c0ad878b3a3a1ab081","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}