{"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/3","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":3,"pages_in_order":8,"rows_per_page":100,"rows":[201,300],"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/2","next":"/task/matrix-completion/papers/4","papers":[{"url":null,"slug":"nonconvex-federated-learning-on-compact","title":"Nonconvex Federated Learning on Compact Smooth Submanifolds With Heterogeneous Data","date":"2024-06-12","arxiv_id":"2406.08465","repositories_listed":0,"syntology":null},{"url":null,"slug":"symmetric-matrix-completion-with-relu","title":"Symmetric Matrix Completion with ReLU Sampling","date":"2024-06-09","arxiv_id":"2406.05822","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-majorized-pam-method-with-subspace","title":"Convergence of the majorized PAM method with subspace correction for low-rank composite factorization model","date":"2024-06-07","arxiv_id":"2406.04588","repositories_listed":0,"syntology":null},{"url":null,"slug":"connectivity-shapes-implicit-regularization","title":"Connectivity Shapes Implicit Regularization in Matrix Factorization Models for Matrix Completion","date":"2024-05-22","arxiv_id":"2405.13721","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-radius-of-statistical-efficiency","title":"The radius of statistical efficiency","date":"2024-05-15","arxiv_id":"2405.09676","repositories_listed":0,"syntology":null},{"url":null,"slug":"subspace-informed-matrix-completion","title":"Subspace-Informed Matrix Completion","date":"2024-05-13","arxiv_id":"2405.07890","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-federated-low-rank-matrix","title":"Efficient Federated Low Rank Matrix Completion","date":"2024-05-10","arxiv_id":"2405.06569","repositories_listed":0,"syntology":null},{"url":null,"slug":"discrete-aware-matrix-completion-via","title":"Discrete Aware Matrix Completion via Convexized $\\ell_0$-Norm Approximation","date":"2024-05-03","arxiv_id":"2405.02101","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-policy-learning-and-inference-by","title":"Online Policy Learning and Inference by Matrix Completion","date":"2024-04-26","arxiv_id":"2404.17398","repositories_listed":0,"syntology":null},{"url":null,"slug":"structured-conformal-inference-for-matrix","title":"Structured Conformal Inference for Matrix Completion with Applications to Group Recommender Systems","date":"2024-04-26","arxiv_id":"2404.17561","repositories_listed":0,"syntology":null},{"url":null,"slug":"concentration-properties-of-fractional","title":"Concentration properties of fractional posterior in 1-bit matrix completion","date":"2024-04-13","arxiv_id":"2404.08969","repositories_listed":0,"syntology":null},{"url":null,"slug":"energy-modified-leverage-sampling-for-radio","title":"Energy-modified Leverage Sampling for Radio Map Construction via Matrix Completion","date":"2024-04-12","arxiv_id":"2404.08286","repositories_listed":0,"syntology":null},{"url":null,"slug":"statistical-inference-for-noisy-matrix","title":"Statistical Inference For Noisy Matrix Completion Incorporating Auxiliary Information","date":"2024-03-22","arxiv_id":"2403.14899","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-completion-via-nonsmooth","title":"Matrix Completion via Nonsmooth Regularization of Fully Connected Neural Networks","date":"2024-03-15","arxiv_id":"2403.10232","repositories_listed":0,"syntology":null},{"url":null,"slug":"collaborative-automotive-radar-sensing-via","title":"Collaborative Automotive Radar Sensing via Mixed-Precision Distributed Array Completion","date":"2024-03-13","arxiv_id":"2403.08168","repositories_listed":0,"syntology":null},{"url":null,"slug":"sensor-network-localization-via-riemannian","title":"Sensor Network Localization via Riemannian Conjugate Gradient and Rank Reduction: An Extended Version","date":"2024-03-13","arxiv_id":"2403.08442","repositories_listed":0,"syntology":null},{"url":null,"slug":"power-flow-embedded-projection-conic-matrix","title":"Power-Flow-Embedded Projection Conic Matrix Completion for Low-Observable Distribution Systems","date":"2024-03-08","arxiv_id":"2403.04985","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-matrix-completion-by-exploiting","title":"Improving Matrix Completion by Exploiting Rating Ordinality in Graph Neural Networks","date":"2024-03-07","arxiv_id":"2403.04504","repositories_listed":0,"syntology":null},{"url":null,"slug":"blockecho-retaining-long-range-dependencies","title":"BlockEcho: Retaining Long-Range Dependencies for Imputing Block-Wise Missing Data","date":"2024-02-29","arxiv_id":"2402.18800","repositories_listed":0,"syntology":null},{"url":null,"slug":"entry-specific-bounds-for-low-rank-matrix","title":"Entry-Specific Bounds for Low-Rank Matrix Completion under Highly Non-Uniform Sampling","date":"2024-02-29","arxiv_id":"2403.00184","repositories_listed":0,"syntology":null},{"url":null,"slug":"discovering-symmetry-group-structures-via","title":"Discovering Abstract Symbolic Relations by Learning Unitary Group Representations","date":"2024-02-26","arxiv_id":"2402.17002","repositories_listed":0,"syntology":null},{"url":null,"slug":"causal-imputation-for-counterfactual-scms","title":"Causal Imputation for Counterfactual SCMs: Bridging Graphs and Latent Factor Models","date":"2024-02-22","arxiv_id":"2402.14777","repositories_listed":0,"syntology":null},{"url":null,"slug":"doubly-robust-inference-in-causal-latent","title":"Doubly Robust Inference in Causal Latent Factor Models","date":"2024-02-18","arxiv_id":"2402.11652","repositories_listed":0,"syntology":null},{"url":null,"slug":"convergence-of-gradient-descent-with-small","title":"Convergence of Gradient Descent with Small Initialization for Unregularized Matrix Completion","date":"2024-02-09","arxiv_id":"2402.06756","repositories_listed":0,"syntology":null},{"url":null,"slug":"high-dimensional-factor-analysis-with-weak","title":"High Dimensional Factor Analysis with Weak Factors","date":"2024-02-08","arxiv_id":"2402.05789","repositories_listed":0,"syntology":null},{"url":null,"slug":"mixed-matrix-completion-in-complex-survey","title":"Mixed Matrix Completion in Complex Survey Sampling under Heterogeneous Missingness","date":"2024-02-06","arxiv_id":"2402.03954","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-driven-model-selection-within-the-matrix","title":"Data-driven model selection within the matrix completion method for causal panel data models","date":"2024-02-02","arxiv_id":"2402.01069","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-dual-regularized-autoencoder-for-sparse","title":"Fast Dual-Regularized Autoencoder for Sparse Biological Data","date":"2024-01-30","arxiv_id":"2401.16664","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-robustness-of-cross-concentrated","title":"On the Robustness of Cross-Concentrated Sampling for Matrix Completion","date":"2024-01-28","arxiv_id":"2401.15566","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-completion-with-hypergraphs-sharp","title":"Matrix Completion with Hypergraphs:Sharp Thresholds and Efficient Algorithms","date":"2024-01-16","arxiv_id":"2401.08197","repositories_listed":0,"syntology":null},{"url":null,"slug":"effect-of-beampattern-on-matrix-completion","title":"Effect of Beampattern on Matrix Completion with Sparse Arrays","date":"2024-01-12","arxiv_id":"2401.06494","repositories_listed":0,"syntology":null},{"url":null,"slug":"polynomial-precision-dependence-solutions-to","title":"Polynomial Precision Dependence Solutions to Alignment Research Center Matrix Completion Problems","date":"2024-01-08","arxiv_id":"2401.03999","repositories_listed":0,"syntology":null},{"url":null,"slug":"misclassification-excess-risk-bounds-for-1","title":"Misclassification excess risk bounds for 1-bit matrix completion","date":"2023-12-20","arxiv_id":"2312.12945","repositories_listed":0,"syntology":null},{"url":null,"slug":"waveform-design-for-ofdm-based-isac-systems","title":"Waveform Design for OFDM-based ISAC Systems Under Resource Occupancy Constraint","date":"2023-12-19","arxiv_id":"2312.12298","repositories_listed":0,"syntology":null},{"url":null,"slug":"automotive-radar-sensing-with-sparse-linear","title":"Automotive Radar Sensing with Sparse Linear Arrays Using One-Bit Hankel Matrix Completion","date":"2023-12-09","arxiv_id":"2312.05423","repositories_listed":0,"syntology":null},{"url":null,"slug":"multiple-testing-of-linear-forms-for-noisy","title":"Multiple Testing of Linear Forms for Noisy Matrix Completion","date":"2023-12-01","arxiv_id":"2312.00305","repositories_listed":0,"syntology":null},{"url":null,"slug":"iterative-missing-value-imputation-based-on","title":"Iterative missing value imputation based on feature importance","date":"2023-11-14","arxiv_id":"2311.08005","repositories_listed":0,"syntology":null},{"url":null,"slug":"harmonic-retrieval-using-weighted-lifted","title":"Harmonic Retrieval Using Weighted Lifted-Structure Low-Rank Matrix Completion","date":"2023-11-08","arxiv_id":"2311.05003","repositories_listed":0,"syntology":null},{"url":null,"slug":"blocked-collaborative-bandits-online","title":"Blocked Collaborative Bandits: Online Collaborative Filtering with Per-Item Budget Constraints","date":"2023-10-31","arxiv_id":"2311.03376","repositories_listed":0,"syntology":null},{"url":null,"slug":"triple-simplex-matrix-completion-for-expense","title":"Triple Simplex Matrix Completion for Expense Forecasting","date":"2023-10-23","arxiv_id":"2310.15275","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-framework-to-generate-sparsity-inducing","title":"A framework to generate sparsity-inducing regularizers for enhanced low-rank matrix completion","date":"2023-10-08","arxiv_id":"2310.04954","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-matrix-completion-via-novel-m","title":"Robust matrix completion via Novel M-estimator Functions","date":"2023-10-08","arxiv_id":"2310.04953","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-low-rank-matrix-completion-via-a-new","title":"Robust Low-Rank Matrix Completion via a New Sparsity-Inducing Regularizer","date":"2023-10-07","arxiv_id":"2310.04762","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-completion-informed-deep-unfolded","title":"Matrix Completion-Informed Deep Unfolded Equilibrium Models for Self-Supervised k-Space Interpolation in MRI","date":"2023-09-24","arxiv_id":"2309.13571","repositories_listed":0,"syntology":null},{"url":null,"slug":"iht-inspired-neural-network-for-single","title":"IHT-Inspired Neural Network for Single-Snapshot DOA Estimation with Sparse Linear Arrays","date":"2023-09-15","arxiv_id":"2309.08429","repositories_listed":0,"syntology":null},{"url":null,"slug":"l-21-norm-regularized-quaternion-matrix","title":"$L_{2,1}$-Norm Regularized Quaternion Matrix Completion Using Sparse Representation and Quaternion QR Decomposition","date":"2023-09-07","arxiv_id":"2309.03764","repositories_listed":0,"syntology":null},{"url":null,"slug":"widely-separated-mimo-radar-using-matrix","title":"Widely Separated MIMO Radar Using Matrix Completion","date":"2023-08-29","arxiv_id":"2308.15636","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-completion-in-almost-verification-time","title":"Matrix Completion in Almost-Verification Time","date":"2023-08-07","arxiv_id":"2308.03661","repositories_listed":0,"syntology":null},{"url":null,"slug":"color-image-recovery-using-generalized-matrix","title":"Color Image Recovery Using Generalized Matrix Completion over Higher-Order Finite Dimensional Algebra","date":"2023-08-04","arxiv_id":"2308.02621","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-based-system-representations-from","title":"Data-based system representations from irregularly measured data","date":"2023-07-21","arxiv_id":"2307.11589","repositories_listed":0,"syntology":null},{"url":null,"slug":"imposing-consistency-properties-on-blackbox","title":"Imposing Consistency Properties on Blackbox Systems with Applications to SVD-Based Recommender Systems","date":"2023-07-17","arxiv_id":"2307.08760","repositories_listed":0,"syntology":null},{"url":null,"slug":"tackling-combinatorial-distribution-shift-a","title":"Tackling Combinatorial Distribution Shift: A Matrix Completion Perspective","date":"2023-07-12","arxiv_id":"2307.06457","repositories_listed":0,"syntology":null},{"url":null,"slug":"non-convex-optimizations-for-machine-learning","title":"Non-Convex Optimizations for Machine Learning with Theoretical Guarantee: Robust Matrix Completion and Neural Network Learning","date":"2023-06-28","arxiv_id":"2306.16557","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-based-matrix-completion-applied-to","title":"Graph-Based Matrix Completion Applied to Weather Data","date":"2023-06-14","arxiv_id":"2306.08627","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-alternating-minimization-with","title":"Efficient Alternating Minimization with Applications to Weighted Low Rank Approximation","date":"2023-06-07","arxiv_id":"2306.04169","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploiting-observation-bias-to-improve-matrix","title":"Exploiting Observation Bias to Improve Matrix Completion","date":"2023-06-07","arxiv_id":"2306.04775","repositories_listed":0,"syntology":null},{"url":null,"slug":"one-sided-matrix-completion-from-two","title":"One-sided Matrix Completion from Two Observations Per Row","date":"2023-06-06","arxiv_id":"2306.04049","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-completion-from-general-deterministic","title":"Matrix Completion from General Deterministic Sampling Patterns","date":"2023-06-04","arxiv_id":"2306.02283","repositories_listed":0,"syntology":null},{"url":null,"slug":"combining-explicit-and-implicit-1","title":"Combining Explicit and Implicit Regularization for Efficient Learning in Deep Networks","date":"2023-06-01","arxiv_id":"2306.00342","repositories_listed":0,"syntology":null},{"url":null,"slug":"bridging-spectral-embedding-and-matrix","title":"Spectal Harmonics: Bridging Spectral Embedding and Matrix Completion in Self-Supervised Learning","date":"2023-05-31","arxiv_id":"2305.19818","repositories_listed":0,"syntology":null},{"url":null,"slug":"gibbs-duhem-informed-neural-networks-for","title":"Gibbs-Duhem-Informed Neural Networks for Binary Activity Coefficient Prediction","date":"2023-05-31","arxiv_id":"2306.07937","repositories_listed":0,"syntology":null},{"url":null,"slug":"implicit-bias-of-sgd-in-l-2-regularized","title":"Implicit bias of SGD in $L_{2}$-regularized linear DNNs: One-way jumps from high to low rank","date":"2023-05-25","arxiv_id":"2305.16038","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-estimation-for-offline-reinforcement","title":"Matrix Estimation for Offline Reinforcement Learning with Low-Rank Structure","date":"2023-05-24","arxiv_id":"2305.15621","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-low-rank-matrix-completion","title":"Disjunctive Branch-And-Bound for Certifiably Optimal Low-Rank Matrix Completion","date":"2023-05-20","arxiv_id":"2305.12292","repositories_listed":0,"syntology":null},{"url":null,"slug":"misnn-multiple-imputation-via-semi-parametric","title":"MISNN: Multiple Imputation via Semi-parametric Neural Networks","date":"2023-05-02","arxiv_id":"2305.01794","repositories_listed":0,"syntology":null},{"url":null,"slug":"quaternion-matrix-completion-using-untrained","title":"Quaternion Matrix Completion Using Untrained Quaternion Convolutional Neural Network for Color Image Inpainting","date":"2023-04-30","arxiv_id":"2305.00416","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-majorization-minimization-gauss-newton","title":"A Majorization-Minimization Gauss-Newton Method for 1-Bit Matrix Completion","date":"2023-04-27","arxiv_id":"2304.13940","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-addressing-training-data-scarcity","title":"Towards Addressing Training Data Scarcity Challenge in Emerging Radio Access Networks: A Survey and Framework","date":"2023-04-24","arxiv_id":"2304.12480","repositories_listed":0,"syntology":null},{"url":null,"slug":"sequence-aware-item-recommendations-for","title":"Sequence-aware item recommendations for multiply repeated user-item interactions","date":"2023-04-02","arxiv_id":"2304.00578","repositories_listed":0,"syntology":null},{"url":null,"slug":"region-wise-matching-for-image-inpainting","title":"Region-wise matching for image inpainting based on adaptive weighted low-rank decomposition","date":"2023-03-22","arxiv_id":"2303.12421","repositories_listed":0,"syntology":null},{"url":null,"slug":"constructing-high-frequency-economic","title":"Constructing High Frequency Economic Indicators by Imputation","date":"2023-03-03","arxiv_id":"2303.01863","repositories_listed":0,"syntology":null},{"url":null,"slug":"low-rank-matrix-completion-via-robust","title":"Low Rank Matrix Completion via Robust Alternating Minimization in Nearly Linear Time","date":"2023-02-21","arxiv_id":"2302.11068","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-optimization-landscape-of-burer","title":"Can Learning Be Explained By Local Optimality In Robust Low-rank Matrix Recovery?","date":"2023-02-21","arxiv_id":"2302.10963","repositories_listed":0,"syntology":null},{"url":null,"slug":"transductive-matrix-completion-with","title":"Transductive Matrix Completion with Calibration for Multi-Task Learning","date":"2023-02-20","arxiv_id":"2302.09834","repositories_listed":0,"syntology":null},{"url":null,"slug":"netflix-and-forget-efficient-and-exact","title":"Netflix and Forget: Efficient and Exact Machine Unlearning from Bi-linear Recommendations","date":"2023-02-13","arxiv_id":"2302.06676","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-algorithms-for-latent-bandits-with","title":"Optimal Algorithms for Latent Bandits with Cluster Structure","date":"2023-01-17","arxiv_id":"2301.07040","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantizing-heavy-tailed-data-in-statistical","title":"Quantizing Heavy-tailed Data in Statistical Estimation: (Near) Minimax Rates, Covariate Quantization, and Uniform Recovery","date":"2022-12-30","arxiv_id":"2212.14562","repositories_listed":0,"syntology":null},{"url":null,"slug":"rank-1-matrix-completion-with-gradient","title":"Rank-1 Matrix Completion with Gradient Descent and Small Random Initialization","date":"2022-12-19","arxiv_id":"2212.09396","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-bounds-for-inductive-matrix","title":"Generalization Bounds for Inductive Matrix Completion in Low-noise Settings","date":"2022-12-16","arxiv_id":"2212.08339","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-transition-operators-from-sparse","title":"Learning Transition Operators From Sparse Space-Time Samples","date":"2022-12-01","arxiv_id":"2212.00746","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-rigid-body-localization-based-on","title":"Efficient Rigid Body Localization based on Euclidean Distance Matrix Completion for AGV Positioning under Harsh Environment","date":"2022-11-23","arxiv_id":"2211.13092","repositories_listed":0,"syntology":null},{"url":null,"slug":"low-rank-quaternion-matrix-completion-based","title":"Low Rank Quaternion Matrix Completion Based on Quaternion QR Decomposition and Sparse Regularizer","date":"2022-11-23","arxiv_id":"2211.12793","repositories_listed":0,"syntology":null},{"url":null,"slug":"always-valid-risk-monitoring-for-online","title":"Always Valid Risk Monitoring for Online Matrix Completion","date":"2022-11-18","arxiv_id":"2211.10363","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-linear-networks-for-matrix-completion-an","title":"Deep Linear Networks for Matrix Completion -- An Infinite Depth Limit","date":"2022-10-22","arxiv_id":"2210.12497","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-regularized-probabilistic-matrix","title":"Graph Regularized Probabilistic Matrix Factorization for Drug-Drug Interactions Prediction","date":"2022-10-19","arxiv_id":"2210.10784","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-sequence-aware-recommendation-method-based","title":"A Sequence-Aware Recommendation Method Based on Complex Networks","date":"2022-09-30","arxiv_id":"2210.07814","repositories_listed":0,"syntology":null},{"url":null,"slug":"low-rank-covariance-completion-for-graph","title":"Low-Rank Covariance Completion for Graph Quilting with Applications to Functional Connectivity","date":"2022-09-17","arxiv_id":"2209.08273","repositories_listed":0,"syntology":null},{"url":null,"slug":"inductive-matrix-completion-and-root-music","title":"Inductive Matrix Completion and Root-MUSIC-Based Channel Estimation for Intelligent Reflecting Surface (IRS)-Aided Hybrid MIMO Systems","date":"2022-09-15","arxiv_id":"2209.07642","repositories_listed":0,"syntology":null},{"url":null,"slug":"synthesis-of-sparse-linear-arrays-via-low","title":"Synthesis of Sparse Linear Arrays via Low-Rank Hankel Matrix Completion","date":"2022-09-10","arxiv_id":"2209.04577","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-01-matrix-completion-with","title":"Optimal $(0,1)$-Matrix Completion with Majorization Ordered Objectives (To the memory of Pravin Varaiya)","date":"2022-09-09","arxiv_id":"2209.04373","repositories_listed":0,"syntology":null},{"url":null,"slug":"super-rec-surrounding-position-enhanced","title":"SUPER-Rec: SUrrounding Position-Enhanced Representation for Recommendation","date":"2022-09-09","arxiv_id":"2209.04154","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-low-rank-matrix-completion","title":"Online Low Rank Matrix Completion","date":"2022-09-08","arxiv_id":"2209.03997","repositories_listed":0,"syntology":null},{"url":null,"slug":"recursive-gaussian-process-over-graphs-for","title":"Recursive Gaussian Process over graphs for Integrating Multi-timescale Measurements in Low-Observable Distribution Systems","date":"2022-09-04","arxiv_id":"2209.01703","repositories_listed":0,"syntology":null},{"url":null,"slug":"partial-matrix-completion","title":"Partial Matrix Completion","date":"2022-08-25","arxiv_id":"2208.12063","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-novel-plug-and-play-approach-for","title":"A Novel Plug-and-Play Approach for Adversarially Robust Generalization","date":"2022-08-19","arxiv_id":"2208.09449","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-latent-feature-analysis-based-approach-for","title":"A Latent Feature Analysis-based Approach for Spatio-Temporal Traffic Data Recovery","date":"2022-08-16","arxiv_id":"2208.07739","repositories_listed":0,"syntology":null},{"url":null,"slug":"semidefinite-programming-versus-burer","title":"Semidefinite Programming versus Burer-Monteiro Factorization for Matrix Sensing","date":"2022-08-15","arxiv_id":"2208.07469","repositories_listed":0,"syntology":null},{"url":null,"slug":"propagation-map-reconstruction-via","title":"Propagation Map Reconstruction via Interpolation Assisted Matrix Completion","date":"2022-07-27","arxiv_id":"2207.13473","repositories_listed":0,"syntology":null},{"url":null,"slug":"sp2-a-second-order-stochastic-polyak-method","title":"SP2: A Second Order Stochastic Polyak Method","date":"2022-07-17","arxiv_id":"2207.08171","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-neural-networks-for-temperature","title":"Graph Neural Networks for Temperature-Dependent Activity Coefficient Prediction of Solutes in Ionic Liquids","date":"2022-06-23","arxiv_id":"2206.11776","repositories_listed":0,"syntology":null}],"record_sha256":"595b501a4431c473ab2776c77b2b4397d2ad695282721c6fcb5b6171c20192a5","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}