{"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/2k/papers/3","list_of":"/task/2k","task":"2k","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":3,"rows_per_page":100,"rows":[201,288],"of":288,"counts":{"archive_papers_tagged":288,"with_a_code_link":126,"where_syntology_ran_a_sample":47,"not_listed_spam_title":0,"listed":288,"listed_where_code_ran":47,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":40,"every_run_a_failure_of_syntologys_instrument":7,"listed_with_a_run_with_no_instrument_failure":40,"listed_every_run_a_failure_of_syntologys_instrument":7,"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/2k","prev":"/task/2k/papers/2","next":null,"papers":[{"url":null,"slug":"nlcunet-single-image-super-resolution-network","title":"NLCUnet: Single-Image Super-Resolution Network with Hairline Details","date":"2023-07-22","arxiv_id":"2307.12014","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":"solving-projected-model-counting-by-utilizing","title":"Solving Projected Model Counting by Utilizing Treewidth and its Limits","date":"2023-05-30","arxiv_id":"2305.19212","repositories_listed":0,"syntology":null},{"url":null,"slug":"inter-connection-effective-connection-between","title":"Inter-connection: Effective Connection between Pre-trained Encoder and Decoder for Speech Translation","date":"2023-05-26","arxiv_id":"2305.16897","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-theoretical-analysis-of-optimistic-proximal","title":"A Theoretical Analysis of Optimistic Proximal Policy Optimization in Linear Markov Decision Processes","date":"2023-05-15","arxiv_id":"2305.08841","repositories_listed":0,"syntology":null},{"url":null,"slug":"vmesh-hybrid-volume-mesh-representation-for","title":"VMesh: Hybrid Volume-Mesh Representation for Efficient View Synthesis","date":"2023-03-28","arxiv_id":"2303.16184","repositories_listed":0,"syntology":null},{"url":null,"slug":"approximate-numerical-solutions-of-fractional","title":"Approximate numerical solutions of fractional integral equations using Laguerre and Touchard polynomials","date":"2023-03-12","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"defining-binary-phylogenetic-trees-using-1","title":"Defining binary phylogenetic trees using parsimony: new bounds","date":"2023-03-06","arxiv_id":"2303.03238","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-prediction-using-expert-advice-and","title":"Optimal Prediction Using Expert Advice and Randomized Littlestone Dimension","date":"2023-02-27","arxiv_id":"2302.13849","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-mean-estimation-without-a-mean","title":"Robust Mean Estimation Without Moments for Symmetric Distributions","date":"2023-02-21","arxiv_id":"2302.10844","repositories_listed":0,"syntology":null},{"url":null,"slug":"concurrent-shuffle-differential-privacy-under","title":"Concurrent Shuffle Differential Privacy Under Continual Observation","date":"2023-01-29","arxiv_id":"2301.12535","repositories_listed":0,"syntology":null},{"url":null,"slug":"high-quality-supersampling-via-mask","title":"High-Quality Real-Time Rendering Using Subpixel Sampling Reconstruction","date":"2023-01-03","arxiv_id":"2301.01036","repositories_listed":0,"syntology":null},{"url":null,"slug":"clothpose-a-real-world-benchmark-for-visual","title":"ClothPose: A Real-world Benchmark for Visual Analysis of Garment Pose via An Indirect Recording Solution","date":"2023-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"variant-parallelism-lightweight-deep","title":"Variant Parallelism: Lightweight Deep Convolutional Models for Distributed Inference on IoT Devices","date":"2022-10-15","arxiv_id":"2210.08376","repositories_listed":0,"syntology":null},{"url":null,"slug":"aggregating-crowdsourced-and-automatic","title":"Aggregating Crowdsourced and Automatic Judgments to Scale Up a Corpus of Anaphoric Reference for Fiction and Wikipedia Texts","date":"2022-10-11","arxiv_id":"2210.05581","repositories_listed":0,"syntology":null},{"url":null,"slug":"leveraging-progressive-model-and-overfitting","title":"Leveraging progressive model and overfitting for efficient learned image compression","date":"2022-10-08","arxiv_id":"2210.04112","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-multivariate-complexity-analysis-of","title":"A Multivariate Complexity Analysis of Qualitative Reasoning Problems","date":"2022-09-30","arxiv_id":"2209.15275","repositories_listed":0,"syntology":null},{"url":null,"slug":"view-aware-salient-object-detection-for","title":"View-aware Salient Object Detection for 360° Omnidirectional Image","date":"2022-09-27","arxiv_id":"2209.13222","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-efficient-algorithm-for-fair-multi-agent","title":"An Efficient Algorithm for Fair Multi-Agent Multi-Armed Bandit with Low Regret","date":"2022-09-23","arxiv_id":"2209.11817","repositories_listed":0,"syntology":null},{"url":null,"slug":"telepresence-video-quality-assessment","title":"Telepresence Video Quality Assessment","date":"2022-07-20","arxiv_id":"2207.09956","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-topological-ordering-for-computation","title":"Neural Topological Ordering for Computation Graphs","date":"2022-07-13","arxiv_id":"2207.05899","repositories_listed":0,"syntology":null},{"url":"/paper/the-generalized-eigenvalue-problem-as-a-nash","slug":"the-generalized-eigenvalue-problem-as-a-nash","title":"The Symmetric Generalized Eigenvalue Problem as a Nash Equilibrium","date":"2022-06-10","arxiv_id":"2206.04993","repositories_listed":0,"syntology":{"n":6,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/the-generalized-eigenvalue-problem-as-a-nash#ran","syntology_url":"https://syntology.ai/paper/2206.04993","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.04993"}},"official":null}},{"url":null,"slug":"two-dimensional-quantum-material","title":"Two-Dimensional Quantum Material Identification via Self-Attention and Soft-labeling in Deep Learning","date":"2022-05-31","arxiv_id":"2205.15948","repositories_listed":0,"syntology":null},{"url":null,"slug":"mining-root-cause-knowledge-from-cloud","title":"Mining Root Cause Knowledge from Cloud Service Incident Investigations for AIOps","date":"2022-04-21","arxiv_id":"2204.11598","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-probability-of-a-condorcet-winner","title":"On the probability of a Condorcet winner among a large number of alternatives","date":"2022-03-25","arxiv_id":"2203.13713","repositories_listed":0,"syntology":null},{"url":null,"slug":"high-density-coding-scheme-for-swipt-systems","title":"High-Density Coding Scheme for SWIPT Systems","date":"2022-03-18","arxiv_id":"2203.10047","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-density-peaks-clustering-algorithm-with","title":"A density peaks clustering algorithm with sparse search and K-d tree","date":"2022-03-02","arxiv_id":"2203.00973","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-view-learning-with-privileged-weighted","title":"Multi-view learning with privileged weighted twin support vector machine","date":"2022-01-27","arxiv_id":"2201.11306","repositories_listed":0,"syntology":null},{"url":null,"slug":"humanibr-high-quality-image-based-rendering","title":"HDhuman: High-quality Human Novel-view Rendering from Sparse Views","date":"2022-01-20","arxiv_id":"2201.08158","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-optimization-with-feedback-delay-and","title":"Online Optimization with Feedback Delay and Nonlinear Switching Cost","date":"2021-10-29","arxiv_id":"2111.00095","repositories_listed":0,"syntology":null},{"url":null,"slug":"domain-adaptation-for-rare-classes-augmented","title":"Domain Adaptation for Rare Classes Augmented with Synthetic Samples","date":"2021-10-23","arxiv_id":"2110.12216","repositories_listed":0,"syntology":null},{"url":null,"slug":"arbitrary-depth-universal-approximation","title":"Arbitrary-Depth Universal Approximation Theorems for Operator Neural Networks","date":"2021-09-23","arxiv_id":"2109.11354","repositories_listed":0,"syntology":null},{"url":null,"slug":"do-long-range-language-models-actually-use","title":"Do Long-Range Language Models Actually Use Long-Range Context?","date":"2021-09-19","arxiv_id":"2109.09115","repositories_listed":0,"syntology":null},{"url":null,"slug":"tensor-principal-component-analysis-in-high","title":"Tensor Principal Component Analysis in High Dimensional CP Models","date":"2021-08-10","arxiv_id":"2108.04428","repositories_listed":0,"syntology":null},{"url":null,"slug":"characterizing-social-imaginaries-and-self","title":"Characterizing Social Imaginaries and Self-Disclosures of Dissonance in Online Conspiracy Discussion Communities","date":"2021-07-21","arxiv_id":"2107.10204","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-pose-transfer-with-dynamic-details","title":"Robust Pose Transfer with Dynamic Details using Neural Video Rendering","date":"2021-06-27","arxiv_id":"2106.14132","repositories_listed":0,"syntology":null},{"url":null,"slug":"simple-combinatorial-algorithms-for","title":"Simple Combinatorial Algorithms for Combinatorial Bandits: Corruptions and Approximations","date":"2021-06-12","arxiv_id":"2106.06712","repositories_listed":0,"syntology":null},{"url":null,"slug":"beyond-bandit-feedback-in-online-multiclass","title":"Beyond Bandit Feedback in Online Multiclass Classification","date":"2021-06-07","arxiv_id":"2106.03596","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-optimal-power-allocation-and-user","title":"On the Optimal Power Allocation and User Pairing for Uplink Non-Orthogonal Multiple Access Networks","date":"2021-04-20","arxiv_id":"2104.11679","repositories_listed":0,"syntology":null},{"url":null,"slug":"lu-bzu-at-semeval-2021-task-2-word2vec-and","title":"LU-BZU at SemEval-2021 Task 2: Word2Vec and Lemma2Vec performance in Arabic Word-in-Context disambiguation","date":"2021-04-16","arxiv_id":"2104.08110","repositories_listed":0,"syntology":null},{"url":null,"slug":"beyond-pointwise-submodularity-non-monotone-1","title":"Beyond Pointwise Submodularity: Non-Monotone Adaptive Submodular Maximization subject to Knapsack and $k$-System Constraints","date":"2021-04-10","arxiv_id":"2104.04853","repositories_listed":0,"syntology":null},{"url":null,"slug":"differential-private-hogwild-over-distributed","title":"Proactive DP: A Multple Target Optimization Framework for DP-SGD","date":"2021-02-17","arxiv_id":"2102.09030","repositories_listed":0,"syntology":null},{"url":null,"slug":"motion-aware-dynamic-architecture-for","title":"Motion-Aware Dynamic Architecture for Efficient Frame Interpolation","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-canonical-correlation-analysis-a","title":"Stochastic Canonical Correlation Analysis: A Riemannian Approach","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"theoretical-analyses-of-multi-objective","title":"Theoretical Analyses of Multiobjective Evolutionary Algorithms on Multimodal Objectives","date":"2020-12-14","arxiv_id":"2012.07231","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-online-estimation-of-piecewise","title":"Adaptive Online Estimation of Piecewise Polynomial Trends","date":"2020-09-30","arxiv_id":"2010.00073","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-sparse-hausdorff-moment-problem-with","title":"The Sparse Hausdorff Moment Problem, with Application to Topic Models","date":"2020-07-16","arxiv_id":"2007.08101","repositories_listed":0,"syntology":null},{"url":null,"slug":"perceptual-hashing-applied-to-tor-domains","title":"Perceptual Hashing applied to Tor domains recognition","date":"2020-05-20","arxiv_id":"2005.10090","repositories_listed":0,"syntology":null},{"url":null,"slug":"maximizing-determinants-under-matroid","title":"Maximizing Determinants under Matroid Constraints","date":"2020-04-16","arxiv_id":"2004.07886","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-vc-dimension-of-k-vertex-d-polytopes","title":"The VC-dimension of k-vertex d-polytopes","date":"2020-04-09","arxiv_id":"2004.04841","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-image-labeling-tool-and-agricultural","title":"An Image Labeling Tool and Agricultural Dataset for Deep Learning","date":"2020-04-06","arxiv_id":"2004.03351","repositories_listed":0,"syntology":null},{"url":null,"slug":"approximability-of-monotone-submodular","title":"Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model","date":"2020-02-13","arxiv_id":"2002.05477","repositories_listed":0,"syntology":null},{"url":null,"slug":"lower-bounds-for-compressed-sensing-with","title":"Lower Bounds for Compressed Sensing with Generative Models","date":"2019-12-06","arxiv_id":"1912.02938","repositories_listed":0,"syntology":null},{"url":null,"slug":"consistent-recovery-threshold-of-hidden","title":"Consistent recovery threshold of hidden nearest neighbor graphs","date":"2019-11-18","arxiv_id":"1911.08004","repositories_listed":0,"syntology":null},{"url":null,"slug":"minimax-regret-of-switching-constrained","title":"Minimax Regret of Switching-Constrained Online Convex Optimization: No Phase Transition","date":"2019-10-24","arxiv_id":"1910.10873","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-character-level-convolutional-bilstm-for","title":"A Character Level Convolutional BiLSTM for Arabic Dialect Identification","date":"2019-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"composable-core-sets-for-determinant-1","title":"Composable Core-sets for Determinant Maximization: A Simple Near-Optimal Algorithm","date":"2019-07-06","arxiv_id":"1907.03197","repositories_listed":0,"syntology":null},{"url":null,"slug":"latent-dirichlet-allocation-based-acoustic","title":"Latent Dirichlet Allocation Based Acoustic Data Selection for Automatic Speech Recognition","date":"2019-07-02","arxiv_id":"1907.01302","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-lexical-gap-an-improved-measure-of","title":"The Lexical Gap: An Improved Measure of Automated Image Description Quality","date":"2019-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"morphic-a-65-nm-738k-synapsemm2-quad-core","title":"MorphIC: A 65-nm 738k-Synapse/mm$^2$ Quad-Core Binary-Weight Digital Neuromorphic Processor with Stochastic Spike-Driven Online Learning","date":"2019-04-17","arxiv_id":"1904.08513","repositories_listed":0,"syntology":null},{"url":null,"slug":"detecting-cybersecurity-events-from-noisy","title":"Detecting Cybersecurity Events from Noisy Short Text","date":"2019-04-10","arxiv_id":"1904.05054","repositories_listed":0,"syntology":null},{"url":null,"slug":"continuous-integration-of-machine-learning","title":"Continuous Integration of Machine Learning Models with ease.ml/ci: Towards a Rigorous Yet Practical Treatment","date":"2019-03-01","arxiv_id":"1903.00278","repositories_listed":0,"syntology":null},{"url":null,"slug":"invariant-and-equivariant-graph-networks","title":"Invariant and Equivariant Graph Networks","date":"2018-12-24","arxiv_id":"1812.09902","repositories_listed":0,"syntology":null},{"url":null,"slug":"fine-grained-video-captioning-for-sports","title":"Fine-Grained Video Captioning for Sports Narrative","date":"2018-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-estimation-of-gaussian","title":"Distributed Estimation of Gaussian Correlations","date":"2018-05-31","arxiv_id":"1805.12472","repositories_listed":0,"syntology":null},{"url":null,"slug":"strongly-polynomial-efficient-approximation","title":"Strongly polynomial efficient approximation scheme for segmentation","date":"2018-05-28","arxiv_id":"1805.11170","repositories_listed":0,"syntology":null},{"url":null,"slug":"laconic-deep-learning-computing","title":"Laconic Deep Learning Computing","date":"2018-05-10","arxiv_id":"1805.04513","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-approach-to-one-bit-compressed-sensing","title":"An Approach to One-Bit Compressed Sensing Based on Probably Approximately Correct Learning Theory","date":"2017-10-22","arxiv_id":"1710.07973","repositories_listed":0,"syntology":null},{"url":null,"slug":"near-optimal-linear-decision-trees-for-k-sum","title":"Near-optimal linear decision trees for k-SUM and related problems","date":"2017-05-04","arxiv_id":"1705.01720","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-statistical-efficiency-of","title":"On the Statistical Efficiency of Compositional Nonparametric Prediction","date":"2017-04-06","arxiv_id":"1704.01896","repositories_listed":0,"syntology":null},{"url":null,"slug":"locality-sensitive-hashing-of-curves","title":"Locality-sensitive hashing of curves","date":"2017-03-11","arxiv_id":"1703.04040","repositories_listed":0,"syntology":null},{"url":null,"slug":"viewpoint-selection-for-photographing","title":"Viewpoint Selection for Photographing Architectures","date":"2017-03-06","arxiv_id":"1703.01702","repositories_listed":0,"syntology":null},{"url":null,"slug":"resparc-a-reconfigurable-and-energy-efficient","title":"RESPARC: A Reconfigurable and Energy-Efficient Architecture with Memristive Crossbars for Deep Spiking Neural Networks","date":"2017-02-20","arxiv_id":"1702.06064","repositories_listed":0,"syntology":null},{"url":null,"slug":"high-dimensional-regression-with-binary","title":"High-Dimensional Regression with Binary Coefficients. Estimating Squared Error and a Phase Transition","date":"2017-01-16","arxiv_id":"1701.04455","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalized-fourier-bessel-operator-and","title":"Generalized Fourier-Bessel operator and almost-periodic interpolation and approximation","date":"2016-11-23","arxiv_id":"1612.00056","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-communication-efficient-parallel-algorithm","title":"A Communication-Efficient Parallel Algorithm for Decision Tree","date":"2016-11-04","arxiv_id":"1611.01276","repositories_listed":0,"syntology":null},{"url":null,"slug":"low-tubal-rank-tensor-completion-using","title":"Low-tubal-rank Tensor Completion using Alternating Minimization","date":"2016-10-05","arxiv_id":"1610.01690","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-mixtures-of-plackett-luce-models","title":"Learning Mixtures of Plackett-Luce Models","date":"2016-03-23","arxiv_id":"1603.07323","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-ibm-2016-speaker-recognition-system","title":"The IBM 2016 Speaker Recognition System","date":"2016-02-23","arxiv_id":"1602.07291","repositories_listed":0,"syntology":null},{"url":null,"slug":"g-cnn-an-iterative-grid-based-object-detector","title":"G-CNN: an Iterative Grid Based Object Detector","date":"2015-12-24","arxiv_id":"1512.07729","repositories_listed":0,"syntology":null},{"url":null,"slug":"submatrix-localization-via-message-passing","title":"Submatrix localization via message passing","date":"2015-10-30","arxiv_id":"1510.09219","repositories_listed":0,"syntology":null},{"url":null,"slug":"representation-benefits-of-deep-feedforward","title":"Representation Benefits of Deep Feedforward Networks","date":"2015-09-27","arxiv_id":"1509.08101","repositories_listed":0,"syntology":null},{"url":null,"slug":"dimensionality-reduction-with-subspace","title":"Dimensionality Reduction with Subspace Structure Preservation","date":"2014-12-07","arxiv_id":"1412.2404","repositories_listed":0,"syntology":null},{"url":null,"slug":"extensions-of-the-sign-language-recognition","title":"Extensions of the Sign Language Recognition and Translation Corpus RWTH-PHOENIX-Weather","date":"2014-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"clause-learning-algorithms-with-many-restarts","title":"Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution","date":"2014-01-16","arxiv_id":"1401.3868","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-mixtures-of-arbitrary-distributions","title":"Learning Mixtures of Arbitrary Distributions over Large Discrete Domains","date":"2012-12-07","arxiv_id":"1212.1527","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-pseudo-boolean-k-dnf-and-submodular","title":"Learning pseudo-Boolean k-DNF and Submodular Functions","date":"2012-08-10","arxiv_id":"1208.2294","repositories_listed":0,"syntology":null},{"url":null,"slug":"orthogonal-matching-pursuit-from-noisy-random","title":"Orthogonal Matching Pursuit From Noisy Random Measurements: A New Analysis","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"record_sha256":"e66f307434077be7a148b89647914b33c2604bd6892f9c2514d6b3ff06bf4f98","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}