{"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/quantization/papers/15","list_of":"/task/quantization","task":"Quantization","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":15,"pages_in_order":50,"rows_per_page":100,"rows":[1401,1500],"of":4925,"counts":{"archive_papers_tagged":4925,"with_a_code_link":1596,"where_syntology_ran_a_sample":515,"not_listed_spam_title":0,"listed":4925,"listed_where_code_ran":515,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":452,"every_run_a_failure_of_syntologys_instrument":63,"listed_with_a_run_with_no_instrument_failure":452,"listed_every_run_a_failure_of_syntologys_instrument":63,"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/quantization","prev":"/task/quantization/papers/14","next":"/task/quantization/papers/16","papers":[{"url":"/paper/neural-network-activation-quantization-with","slug":"neural-network-activation-quantization-with","title":"Neural Network Activation Quantization with Bitwise Information Bottlenecks","date":"2020-06-09","arxiv_id":"2006.05210","repositories_listed":1,"syntology":null},{"url":"/paper/vqvc-one-shot-voice-conversion-by-vector","slug":"vqvc-one-shot-voice-conversion-by-vector","title":"VQVC+: One-Shot Voice Conversion by Vector Quantization and U-Net architecture","date":"2020-06-07","arxiv_id":"2006.04154","repositories_listed":1,"syntology":null},{"url":"/paper/uveqfed-universal-vector-quantization-for","slug":"uveqfed-universal-vector-quantization-for","title":"UVeQFed: Universal Vector Quantization for Federated Learning","date":"2020-06-05","arxiv_id":"2006.03262","repositories_listed":1,"syntology":null},{"url":"/paper/position-based-scaled-gradient-for-model","slug":"position-based-scaled-gradient-for-model","title":"Position-based Scaled Gradient for Model Quantization and Pruning","date":"2020-05-22","arxiv_id":"2005.11035","repositories_listed":1,"syntology":null},{"url":"/paper/tinylstms-efficient-neural-speech-enhancement","slug":"tinylstms-efficient-neural-speech-enhancement","title":"TinyLSTMs: Efficient Neural Speech Enhancement for Hearing Aids","date":"2020-05-20","arxiv_id":"2005.11138","repositories_listed":1,"syntology":null},{"url":"/paper/vecq-minimal-loss-dnn-model-compression-with","slug":"vecq-minimal-loss-dnn-model-compression-with","title":"VecQ: Minimal Loss DNN Model Compression With Vectorized Weight Quantization","date":"2020-05-18","arxiv_id":"2005.08501","repositories_listed":1,"syntology":null},{"url":"/paper/micronet-for-efficient-language-modeling","slug":"micronet-for-efficient-language-modeling","title":"MicroNet for Efficient Language Modeling","date":"2020-05-16","arxiv_id":"2005.07877","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/micronet-for-efficient-language-modeling#ran","syntology_url":"https://syntology.ai/paper/2005.07877","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.07877"}},"official":{"repos":["mit-han-lab/neurips-micronet"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/a-flexible-extensible-software-framework-for","slug":"a-flexible-extensible-software-framework-for","title":"A flexible, extensible software framework for model compression based on the LC algorithm","date":"2020-05-15","arxiv_id":"2005.07786","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-bits-unifying-quantization-and","slug":"bayesian-bits-unifying-quantization-and","title":"Bayesian Bits: Unifying Quantization and Pruning","date":"2020-05-14","arxiv_id":"2005.07093","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/bayesian-bits-unifying-quantization-and#ran","syntology_url":"https://syntology.ai/paper/2005.07093","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.07093"}},"official":null}},{"url":"/paper/bi3d-stereo-depth-estimation-via-binary","slug":"bi3d-stereo-depth-estimation-via-binary","title":"Bi3D: Stereo Depth Estimation via Binary Classifications","date":"2020-05-14","arxiv_id":"2005.07274","repositories_listed":1,"syntology":null},{"url":"/paper/what-if-adversarial-samples-were-digital","slug":"what-if-adversarial-samples-were-digital","title":"What if Adversarial Samples were Digital Images","date":"2020-05-13","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/data-free-network-quantization-with","slug":"data-free-network-quantization-with","title":"Data-Free Network Quantization With Adversarial Knowledge Distillation","date":"2020-05-08","arxiv_id":"2005.04136","repositories_listed":1,"syntology":null},{"url":"/paper/a-little-bit-more-bitplane-wise-bit-depth","slug":"a-little-bit-more-bitplane-wise-bit-depth","title":"A Little Bit More: Bitplane-Wise Bit-Depth Recovery","date":"2020-05-03","arxiv_id":"2005.01091","repositories_listed":1,"syntology":null},{"url":"/paper/quantization-guided-jpeg-artifact-correction","slug":"quantization-guided-jpeg-artifact-correction","title":"Quantization Guided JPEG Artifact Correction","date":"2020-04-17","arxiv_id":"2004.09320","repositories_listed":1,"syntology":null},{"url":"/paper/deep-neural-network-for-respiratory-sound","slug":"deep-neural-network-for-respiratory-sound","title":"Deep Neural Network for Respiratory Sound Classification in Wearable Devices Enabled by Patient Specific Model Tuning","date":"2020-04-16","arxiv_id":"2004.08287","repositories_listed":1,"syntology":null},{"url":"/paper/minimizing-flops-to-learn-efficient-sparse-1","slug":"minimizing-flops-to-learn-efficient-sparse-1","title":"Minimizing FLOPs to Learn Efficient Sparse Representations","date":"2020-04-12","arxiv_id":"2004.05665","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/minimizing-flops-to-learn-efficient-sparse-1#ran","syntology_url":"https://syntology.ai/paper/2004.05665","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.05665"}},"official":{"repos":["biswajitsc/sparse-embed"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/depthwise-discrete-representation-learning","slug":"depthwise-discrete-representation-learning","title":"Depthwise Discrete Representation Learning","date":"2020-04-11","arxiv_id":"2004.05462","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-person-re-identification-via","slug":"unsupervised-person-re-identification-via","title":"Unsupervised Person Re-identification via Softened Similarity Learning","date":"2020-04-07","arxiv_id":"2004.03547","repositories_listed":1,"syntology":null},{"url":"/paper/logicnets-co-designed-neural-networks-and","slug":"logicnets-co-designed-neural-networks-and","title":"LogicNets: Co-Designed Neural Networks and Circuits for Extreme-Throughput Applications","date":"2020-04-06","arxiv_id":"2004.03021","repositories_listed":1,"syntology":null},{"url":"/paper/single-image-hdr-reconstruction-by-learning","slug":"single-image-hdr-reconstruction-by-learning","title":"Single-Image HDR Reconstruction by Learning to Reverse the Camera Pipeline","date":"2020-04-02","arxiv_id":"2004.01179","repositories_listed":1,"syntology":null},{"url":"/paper/improved-gradient-based-adversarial-attacks","slug":"improved-gradient-based-adversarial-attacks","title":"Improved Gradient based Adversarial Attacks for Quantized Networks","date":"2020-03-30","arxiv_id":"2003.13511","repositories_listed":1,"syntology":null},{"url":"/paper/ftt-nas-discovering-fault-tolerant-neural","slug":"ftt-nas-discovering-fault-tolerant-neural","title":"FTT-NAS: Discovering Fault-Tolerant Convolutional Neural Architecture","date":"2020-03-20","arxiv_id":"2003.10375","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-structure-an-image-with-few","slug":"learning-to-structure-an-image-with-few","title":"Learning to Structure an Image with Few Colors","date":"2020-03-17","arxiv_id":"2003.07848","repositories_listed":1,"syntology":null},{"url":"/paper/fast-distance-based-anomaly-detection-in","slug":"fast-distance-based-anomaly-detection-in","title":"Fast Distance-based Anomaly Detection in Images Using an Inception-like Autoencoder","date":"2020-03-12","arxiv_id":"2003.08731","repositories_listed":1,"syntology":null},{"url":"/paper/ternary-compression-for-communication","slug":"ternary-compression-for-communication","title":"Ternary Compression for Communication-Efficient Federated Learning","date":"2020-03-07","arxiv_id":"2003.03564","repositories_listed":1,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/ternary-compression-for-communication#ran","syntology_url":"https://syntology.ai/paper/2003.03564","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.03564"}},"official":{"repos":["VeritasXu/Ternary-Federated"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/probability-weighted-compact-feature-for","slug":"probability-weighted-compact-feature-for","title":"Probability Weighted Compact Feature for Domain Adaptive Retrieval","date":"2020-03-06","arxiv_id":"2003.03293","repositories_listed":1,"syntology":null},{"url":"/paper/vq-draw-a-sequential-discrete-vae","slug":"vq-draw-a-sequential-discrete-vae","title":"VQ-DRAW: A Sequential Discrete VAE","date":"2020-03-03","arxiv_id":"2003.01599","repositories_listed":1,"syntology":null},{"url":"/paper/image-hashing-by-minimizing-independent","slug":"image-hashing-by-minimizing-independent","title":"Image Hashing by Minimizing Discrete Component-wise Wasserstein Distance","date":"2020-02-29","arxiv_id":"2003.00134","repositories_listed":1,"syntology":null},{"url":"/paper/searching-for-winograd-aware-quantized","slug":"searching-for-winograd-aware-quantized","title":"Searching for Winograd-aware Quantized Networks","date":"2020-02-25","arxiv_id":"2002.10711","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/searching-for-winograd-aware-quantized#ran","syntology_url":"https://syntology.ai/paper/2002.10711","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.10711"}},"official":null}},{"url":"/paper/exploring-the-connection-between-binary-and","slug":"exploring-the-connection-between-binary-and","title":"Exploring the Connection Between Binary and Spiking Neural Networks","date":"2020-02-24","arxiv_id":"2002.10064","repositories_listed":1,"syntology":null},{"url":"/paper/revisiting-saliency-metrics-farthest-neighbor","slug":"revisiting-saliency-metrics-farthest-neighbor","title":"Revisiting Saliency Metrics: Farthest-Neighbor Area Under Curve","date":"2020-02-24","arxiv_id":"2002.10540","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-quantized-autoencoders","slug":"hierarchical-quantized-autoencoders","title":"Hierarchical Quantized Autoencoders","date":"2020-02-19","arxiv_id":"2002.08111","repositories_listed":1,"syntology":null},{"url":"/paper/robust-quantization-one-model-to-rule-them","slug":"robust-quantization-one-model-to-rule-them","title":"Robust Quantization: One Model to Rule Them All","date":"2020-02-18","arxiv_id":"2002.07686","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/robust-quantization-one-model-to-rule-them#ran","syntology_url":"https://syntology.ai/paper/2002.07686","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.07686"}},"official":{"repos":["moranshkolnik/RobustQuantization"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-architectures-for-binary-networks","slug":"learning-architectures-for-binary-networks","title":"Learning Architectures for Binary Networks","date":"2020-02-17","arxiv_id":"2002.06963","repositories_listed":1,"syntology":null},{"url":"/paper/precision-gating-improving-neural-network-1","slug":"precision-gating-improving-neural-network-1","title":"Precision Gating: Improving Neural Network Efficiency with Dynamic Dual-Precision Activations","date":"2020-02-17","arxiv_id":"2002.07136","repositories_listed":1,"syntology":{"n":11,"n_ran":9,"n_constructed":8,"n_ran_checked":9,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 8 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/precision-gating-improving-neural-network-1#ran","syntology_url":"https://syntology.ai/paper/2002.07136","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.07136"}},"official":{"repos":["cornell-zhang/dnn-gating"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":8,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-sharper-first-order-adversary-with","slug":"towards-sharper-first-order-adversary-with","title":"Towards Sharper First-Order Adversary with Quantized Gradients","date":"2020-02-01","arxiv_id":"2002.02372","repositories_listed":1,"syntology":null},{"url":"/paper/improving-lpcnet-based-text-to-speech-with","slug":"improving-lpcnet-based-text-to-speech-with","title":"Improving LPCNet-based Text-to-Speech with Linear Prediction-structured Mixture Density Network","date":"2020-01-31","arxiv_id":"2001.11686","repositories_listed":1,"syntology":null},{"url":"/paper/fast-compact-and-highly-scalable-visual-place","slug":"fast-compact-and-highly-scalable-visual-place","title":"Fast, Compact and Highly Scalable Visual Place Recognition through Sequence-based Matching of Overloaded Representations","date":"2020-01-23","arxiv_id":"2001.08434","repositories_listed":1,"syntology":null},{"url":"/paper/aggregated-learning-a-vector-quantization","slug":"aggregated-learning-a-vector-quantization","title":"Aggregated Learning: A Vector-Quantization Approach to Learning Neural Network Classifiers","date":"2020-01-12","arxiv_id":"2001.03955","repositories_listed":1,"syntology":null},{"url":"/paper/least-squares-binary-quantization-of-neural","slug":"least-squares-binary-quantization-of-neural","title":"Least squares binary quantization of neural networks","date":"2020-01-09","arxiv_id":"2001.02786","repositories_listed":1,"syntology":null},{"url":"/paper/fractional-skipping-towards-finer-grained","slug":"fractional-skipping-towards-finer-grained","title":"Fractional Skipping: Towards Finer-Grained Dynamic CNN Inference","date":"2020-01-03","arxiv_id":"2001.00705","repositories_listed":1,"syntology":{"n":24,"n_ran":16,"n_constructed":3,"n_ran_checked":12,"n_instrument":4,"n_unverified":8,"n_honours":3,"n_violates":0,"n_no_contract":9,"n_pointer_only":16,"phrase":"16 ran (of which 3 constructed an object rather than computing a result; 12 with no instrument failure: 3 honoured, 0 violated, 9 with no contract checked; 4 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/fractional-skipping-towards-finer-grained#ran","syntology_url":"https://syntology.ai/paper/2001.00705","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.00705"}},"official":{"repos":["Torment123/DFS"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":3,"n_ran_no_instrument_failure":4,"n_unverified":6,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/towards-accurate-post-training-network","slug":"towards-accurate-post-training-network","title":"Towards Accurate Post-training Network Quantization via Bit-Split and Stitching","date":"2020-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/adabits-neural-network-quantization-with","slug":"adabits-neural-network-quantization-with","title":"AdaBits: Neural Network Quantization with Adaptive Bit-Widths","date":"2019-12-20","arxiv_id":"1912.09666","repositories_listed":1,"syntology":null},{"url":"/paper/east-encoding-aware-sparse-training-for-deep","slug":"east-encoding-aware-sparse-training-for-deep","title":"EAST: Encoding-Aware Sparse Training for Deep Memory Compression of ConvNets","date":"2019-12-20","arxiv_id":"1912.10087","repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-loss-aware-quantization-for-multi","slug":"adaptive-loss-aware-quantization-for-multi","title":"Adaptive Loss-aware Quantization for Multi-bit Networks","date":"2019-12-18","arxiv_id":"1912.08883","repositories_listed":1,"syntology":null},{"url":"/paper/coresets-for-archetypal-analysis","slug":"coresets-for-archetypal-analysis","title":"Coresets for Archetypal Analysis","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/metaquant-learning-to-quantize-by-learning-to","slug":"metaquant-learning-to-quantize-by-learning-to","title":"MetaQuant: Learning to Quantize by Learning to Penetrate Non-differentiable Quantization","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/normalization-helps-training-of-quantized","slug":"normalization-helps-training-of-quantized","title":"Normalization Helps Training of Quantized LSTM","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/post-training-4-bit-quantization-of-1","slug":"post-training-4-bit-quantization-of-1","title":"Post training 4-bit quantization of convolutional networks for rapid-deployment","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/qsparse-local-sgd-distributed-sgd-with-1","slug":"qsparse-local-sgd-distributed-sgd-with-1","title":"Qsparse-local-SGD: Distributed SGD with Quantization, Sparsification and Local Computations","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/model-aware-deep-architectures-for-one-bit","slug":"model-aware-deep-architectures-for-one-bit","title":"Model-Aware Deep Architectures for One-Bit Compressive Variational Autoencoding","date":"2019-11-27","arxiv_id":"1911.12410","repositories_listed":1,"syntology":null},{"url":"/paper/music-source-separation-in-the-waveform-1","slug":"music-source-separation-in-the-waveform-1","title":"Music Source Separation in the Waveform Domain","date":"2019-11-27","arxiv_id":"1911.13254","repositories_listed":1,"syntology":null},{"url":"/paper/learning-hierarchical-discrete-linguistic","slug":"learning-hierarchical-discrete-linguistic","title":"Learning Hierarchical Discrete Linguistic Units from Visually-Grounded Speech","date":"2019-11-21","arxiv_id":"1911.09602","repositories_listed":1,"syntology":null},{"url":"/paper/quantization-networks-1","slug":"quantization-networks-1","title":"Quantization Networks","date":"2019-11-21","arxiv_id":"1911.09464","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/quantization-networks-1#ran","syntology_url":"https://syntology.ai/paper/1911.09464","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.09464"}},"official":{"repos":["aliyun/alibabacloud-quantization-networks"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/coopnet-cooperative-convolutional-neural","slug":"coopnet-cooperative-convolutional-neural","title":"CoopNet: Cooperative Convolutional Neural Network for Low-Power MCUs","date":"2019-11-19","arxiv_id":"1911.08606","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-discrepancy-between-the-theoretical","slug":"on-the-discrepancy-between-the-theoretical","title":"On the Discrepancy between the Theoretical Analysis and Practical Implementations of Compressed Communication for Distributed Deep Learning","date":"2019-11-19","arxiv_id":"1911.08250","repositories_listed":1,"syntology":null},{"url":"/paper/online-learned-continual-compression-with-1","slug":"online-learned-continual-compression-with-1","title":"Online Learned Continual Compression with Adaptive Quantization Modules","date":"2019-11-19","arxiv_id":"1911.08019","repositories_listed":1,"syntology":null},{"url":"/paper/transductive-zero-shot-hashing-for-multi","slug":"transductive-zero-shot-hashing-for-multi","title":"Transductive Zero-Shot Hashing for Multilabel Image Retrieval","date":"2019-11-17","arxiv_id":"1911.07192","repositories_listed":1,"syntology":null},{"url":"/paper/stagewise-knowledge-distillation","slug":"stagewise-knowledge-distillation","title":"Data Efficient Stagewise Knowledge Distillation","date":"2019-11-15","arxiv_id":"1911.06786","repositories_listed":1,"syntology":null},{"url":"/paper/hyper-sphere-quantization-communication","slug":"hyper-sphere-quantization-communication","title":"Hyper-Sphere Quantization: Communication-Efficient SGD for Federated Learning","date":"2019-11-12","arxiv_id":"1911.04655","repositories_listed":1,"syntology":null},{"url":"/paper/a-programmable-approach-to-model-compression","slug":"a-programmable-approach-to-model-compression","title":"A Programmable Approach to Neural Network Compression","date":"2019-11-06","arxiv_id":"1911.02497","repositories_listed":1,"syntology":null},{"url":"/paper/comprehensive-snn-compression-using-admm","slug":"comprehensive-snn-compression-using-admm","title":"Comprehensive SNN Compression Using ADMM Optimization and Activity Regularization","date":"2019-11-03","arxiv_id":"1911.00822","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/comprehensive-snn-compression-using-admm#ran","syntology_url":"https://syntology.ai/paper/1911.00822","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.00822"}},"official":{"repos":["yjwu17/ADMM-Compression-for-SNNs"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/lfzip-lossy-compression-of-multivariate","slug":"lfzip-lossy-compression-of-multivariate","title":"LFZip: Lossy compression of multivariate floating-point time series data via improved prediction","date":"2019-11-01","arxiv_id":"1911.00208","repositories_listed":1,"syntology":null},{"url":"/paper/a-holistic-approach-to-polyphonic-music","slug":"a-holistic-approach-to-polyphonic-music","title":"A holistic approach to polyphonic music transcription with neural networks","date":"2019-10-26","arxiv_id":"1910.12086","repositories_listed":1,"syntology":null},{"url":"/paper/a-binary-variational-autoencoder-for-hashing","slug":"a-binary-variational-autoencoder-for-hashing","title":"A Binary Variational Autoencoder for Hashing","date":"2019-10-22","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/mirror-descent-view-for-neural-network","slug":"mirror-descent-view-for-neural-network","title":"Mirror Descent View for Neural Network Quantization","date":"2019-10-18","arxiv_id":"1910.08237","repositories_listed":1,"syntology":null},{"url":"/paper/learning-sparsity-and-quantization-jointly","slug":"learning-sparsity-and-quantization-jointly","title":"Automatic Neural Network Compression by Sparsity-Quantization Joint Learning: A Constrained Optimization-based Approach","date":"2019-10-14","arxiv_id":"1910.05897","repositories_listed":1,"syntology":null},{"url":"/paper/remind-your-neural-network-to-prevent","slug":"remind-your-neural-network-to-prevent","title":"REMIND Your Neural Network to Prevent Catastrophic Forgetting","date":"2019-10-06","arxiv_id":"1910.02509","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/remind-your-neural-network-to-prevent#ran","syntology_url":"https://syntology.ai/paper/1910.02509","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.02509"}},"official":{"repos":["tyler-hayes/REMIND"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/quantized-reinforcement-learning-quarl","slug":"quantized-reinforcement-learning-quarl","title":"QuaRL: Quantization for Fast and Environmentally Sustainable Reinforcement Learning","date":"2019-10-02","arxiv_id":"1910.01055","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/quantized-reinforcement-learning-quarl#ran","syntology_url":"https://syntology.ai/paper/1910.01055","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.01055"}},"official":{"repos":["harvard-edge/quarl"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/hierarchical-encoding-of-sequential-data-with","slug":"hierarchical-encoding-of-sequential-data-with","title":"Hierarchical Encoding of Sequential Data With Compact and Sub-Linear Storage Cost","date":"2019-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/xnor-net-improved-binary-neural-networks","slug":"xnor-net-improved-binary-neural-networks","title":"XNOR-Net++: Improved Binary Neural Networks","date":"2019-09-30","arxiv_id":"1909.13863","repositories_listed":1,"syntology":null},{"url":"/paper/additive-powers-of-two-quantization-a-non","slug":"additive-powers-of-two-quantization-a-non","title":"Additive Powers-of-Two Quantization: An Efficient Non-uniform Discretization for Neural Networks","date":"2019-09-28","arxiv_id":"1909.13144","repositories_listed":1,"syntology":null},{"url":"/paper/cat-compression-aware-training-for-bandwidth-1","slug":"cat-compression-aware-training-for-bandwidth-1","title":"CAT: Compression-Aware Training for bandwidth reduction","date":"2019-09-25","arxiv_id":"1909.11481","repositories_listed":1,"syntology":null},{"url":"/paper/goten-gpu-outsourcing-trusted-execution-of","slug":"goten-gpu-outsourcing-trusted-execution-of","title":"Goten: GPU-Outsourcing Trusted Execution of Neural Network Training and Prediction","date":"2019-09-25","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-seek-autonomous-source-seeking","slug":"learning-to-seek-autonomous-source-seeking","title":"Learning to Seek: Autonomous Source Seeking with Deep Reinforcement Learning Onboard a Nano Drone Microcontroller","date":"2019-09-25","arxiv_id":"1909.11236","repositories_listed":1,"syntology":null},{"url":"/paper/communication-censored-distributed-stochastic","slug":"communication-censored-distributed-stochastic","title":"Communication-Censored Distributed Stochastic Gradient Descent","date":"2019-09-09","arxiv_id":"1909.03631","repositories_listed":1,"syntology":null},{"url":"/paper/a-resource-efficient-embedded-iris","slug":"a-resource-efficient-embedded-iris","title":"A Resource-Efficient Embedded Iris Recognition System Using Fully Convolutional Networks","date":"2019-09-08","arxiv_id":"1909.03385","repositories_listed":1,"syntology":null},{"url":"/paper/quantized-fisher-discriminant-analysis","slug":"quantized-fisher-discriminant-analysis","title":"Quantized Fisher Discriminant Analysis","date":"2019-09-06","arxiv_id":"1909.03037","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-downstream-performance-of-compressed","slug":"on-the-downstream-performance-of-compressed","title":"On the Downstream Performance of Compressed Word Embeddings","date":"2019-09-03","arxiv_id":"1909.01264","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/on-the-downstream-performance-of-compressed#ran","syntology_url":"https://syntology.ai/paper/1909.01264","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.01264"}},"official":{"repos":["HazyResearch/smallfry"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/pulp-nn-accelerating-quantized-neural","slug":"pulp-nn-accelerating-quantized-neural","title":"PULP-NN: Accelerating Quantized Neural Networks on Parallel Ultra-Low-Power RISC-V Processors","date":"2019-08-29","arxiv_id":"1908.11263","repositories_listed":1,"syntology":null},{"url":"/paper/nuqsgd-improved-communication-efficiency-for","slug":"nuqsgd-improved-communication-efficiency-for","title":"NUQSGD: Improved Communication Efficiency for Data-parallel SGD via Nonuniform Quantization","date":"2019-08-16","arxiv_id":"1908.06077","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/nuqsgd-improved-communication-efficiency-for#ran","syntology_url":"https://syntology.ai/paper/1908.06077","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.06077"}},"official":{"repos":["fartashf/nuqsgd"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/primary-quantization-matrix-estimation-of","slug":"primary-quantization-matrix-estimation-of","title":"Primary quantization matrix estimation of double compressed JPEG images via CNN","date":"2019-08-09","arxiv_id":"1908.04259","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-computation-of-counterfactual","slug":"efficient-computation-of-counterfactual","title":"Efficient computation of counterfactual explanations of LVQ models","date":"2019-08-02","arxiv_id":"1908.00735","repositories_listed":1,"syntology":null},{"url":"/paper/central-similarity-hashing-via-hadamard","slug":"central-similarity-hashing-via-hadamard","title":"Central Similarity Quantization for Efficient Image and Video Retrieval","date":"2019-08-01","arxiv_id":"1908.00347","repositories_listed":1,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":2,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/central-similarity-hashing-via-hadamard#ran","syntology_url":"https://syntology.ai/paper/1908.00347","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.00347"}},"official":{"repos":["yuanli2333/Hadamard-Matrix-for-hashing"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/deepcabac-a-universal-compression-algorithm","slug":"deepcabac-a-universal-compression-algorithm","title":"DeepCABAC: A Universal Compression Algorithm for Deep Neural Networks","date":"2019-07-27","arxiv_id":"1907.11900","repositories_listed":1,"syntology":null},{"url":"/paper/robust-and-communication-efficient","slug":"robust-and-communication-efficient","title":"Robust and Communication-Efficient Collaborative Learning","date":"2019-07-24","arxiv_id":"1907.10595","repositories_listed":1,"syntology":null},{"url":"/paper/dont-take-it-lightly-phasing-optical-random","slug":"dont-take-it-lightly-phasing-optical-random","title":"Don't take it lightly: Phasing optical random projections with unknown operators","date":"2019-07-03","arxiv_id":"1907.01703","repositories_listed":1,"syntology":null},{"url":"/paper/deep-learning-based-quantization-of-l-values","slug":"deep-learning-based-quantization-of-l-values","title":"Deep Learning-Based Quantization of L-Values for Gray-Coded Modulation","date":"2019-06-18","arxiv_id":"1906.07849","repositories_listed":1,"syntology":null},{"url":"/paper/beyond-product-quantization-deep-progressive","slug":"beyond-product-quantization-deep-progressive","title":"Beyond Product Quantization: Deep Progressive Quantization for Image Retrieval","date":"2019-06-16","arxiv_id":"1906.06698","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/beyond-product-quantization-deep-progressive#ran","syntology_url":"https://syntology.ai/paper/1906.06698","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.06698"}},"official":{"repos":["cfm-uestc/DPQ"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-recurrent-quantization-for-generating","slug":"deep-recurrent-quantization-for-generating","title":"Deep Recurrent Quantization for Generating Sequential Binary Codes","date":"2019-06-16","arxiv_id":"1906.06699","repositories_listed":1,"syntology":null},{"url":"/paper/pca-driven-hybrid-network-design-for-enabling","slug":"pca-driven-hybrid-network-design-for-enabling","title":"Constructing Energy-efficient Mixed-precision Neural Networks through Principal Component Analysis for Edge Intelligence","date":"2019-06-04","arxiv_id":"1906.01493","repositories_listed":1,"syntology":null},{"url":"/paper/190600771","slug":"190600771","title":"A Mean Field Theory of Quantized Deep Networks: The Quantization-Depth Trade-Off","date":"2019-06-03","arxiv_id":"1906.00771","repositories_listed":1,"syntology":null},{"url":"/paper/deep-metric-learning-to-rank","slug":"deep-metric-learning-to-rank","title":"Deep Metric Learning to Rank","date":"2019-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/she-a-fast-and-accurate-privacy-preserving","slug":"she-a-fast-and-accurate-privacy-preserving","title":"SHE: A Fast and Accurate Deep Neural Network for Encrypted Data","date":"2019-06-01","arxiv_id":"1906.00148","repositories_listed":1,"syntology":null},{"url":"/paper/deepshift-towards-multiplication-less-neural","slug":"deepshift-towards-multiplication-less-neural","title":"DeepShift: Towards Multiplication-Less Neural Networks","date":"2019-05-30","arxiv_id":"1905.13298","repositories_listed":1,"syntology":null},{"url":"/paper/communication-efficient-distributed-blockwise","slug":"communication-efficient-distributed-blockwise","title":"Communication-Efficient Distributed Blockwise Momentum SGD with Error-Feedback","date":"2019-05-27","arxiv_id":"1905.10936","repositories_listed":1,"syntology":null},{"url":"/paper/quantization-based-regularization-for","slug":"quantization-based-regularization-for","title":"Quantization-Based Regularization for Autoencoders","date":"2019-05-27","arxiv_id":"1905.11062","repositories_listed":1,"syntology":null},{"url":"/paper/additive-noise-annealing-and-approximation","slug":"additive-noise-annealing-and-approximation","title":"Additive Noise Annealing and Approximation Properties of Quantized Neural Networks","date":"2019-05-24","arxiv_id":"1905.10452","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-groove-with-inverse-sequence","slug":"learning-to-groove-with-inverse-sequence","title":"Learning to Groove with Inverse Sequence Transformations","date":"2019-05-14","arxiv_id":"1905.06118","repositories_listed":1,"syntology":null},{"url":"/paper/aciq-analytical-clipping-for-integer","slug":"aciq-analytical-clipping-for-integer","title":"ACIQ: Analytical Clipping for Integer Quantization of neural networks","date":"2019-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null}],"record_sha256":"6121878c80561e2fc7989f6cae1aba3f2a4c92d656de864d1f62b0e96fb25493","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}