{"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":"/method/early-stopping/papers/4","list_of":"/method/early-stopping","method":"Early Stopping","archive":{"snapshot":"2025-07-28"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"date (newest first), then slug","page":4,"pages_in_order":5,"rows_per_page":100,"rows":[301,400],"of":468,"counts":{"archive_papers_tagged":468,"with_a_code_link":197,"where_syntology_ran_a_sample":51,"not_listed_spam_title":0,"listed":468,"listed_where_code_ran":51,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":41,"every_run_a_failure_of_syntologys_instrument":10,"listed_with_a_run_with_no_instrument_failure":41,"listed_every_run_a_failure_of_syntologys_instrument":10,"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":"/method/early-stopping","prev":"/method/early-stopping/papers/3","next":"/method/early-stopping/papers/5","papers":[{"paper":null,"slug":"sinogram-denoise-based-on-generative","title":"Sinogram Denoise Based on Generative Adversarial Networks","date":"2021-08-09","arxiv_id":"2108.03903","n_code_links":0,"syntology":null},{"paper":"/paper/channel-wise-early-stopping-without-a","slug":"channel-wise-early-stopping-without-a","title":"Channel-Wise Early Stopping without a Validation Set via NNK Polytope Interpolation","date":"2021-07-27","arxiv_id":"2107.12972","n_code_links":1,"syntology":null},{"paper":null,"slug":"stability-generalisation-of-gradient-descent","title":"Stability & Generalisation of Gradient Descent for Shallow Neural Networks without the Neural Tangent Kernel","date":"2021-07-27","arxiv_id":"2107.12723","n_code_links":0,"syntology":null},{"paper":null,"slug":"unrealistic-feature-suppression-for","title":"Unrealistic Feature Suppression for Generative Adversarial Networks","date":"2021-07-23","arxiv_id":"2107.11047","n_code_links":0,"syntology":null},{"paper":null,"slug":"nonparametric-regression-with-shallow","title":"Nonparametric Regression with Shallow Overparameterized Neural Networks Trained by GD with Early Stopping","date":"2021-07-12","arxiv_id":"2107.05341","n_code_links":0,"syntology":null},{"paper":null,"slug":"generalization-by-design-shortcuts-to","title":"Generalization by design: Shortcuts to Generalization in Deep Learning","date":"2021-07-05","arxiv_id":"2107.02253","n_code_links":0,"syntology":null},{"paper":"/paper/chase-robust-visual-tracking-via-cell-level","slug":"chase-robust-visual-tracking-via-cell-level","title":"CHASE: Robust Visual Tracking via Cell-Level Differentiable Neural Architecture Search","date":"2021-07-02","arxiv_id":"2107.03463","n_code_links":1,"syntology":null},{"paper":"/paper/understanding-and-improving-early-stopping","slug":"understanding-and-improving-early-stopping","title":"Understanding and Improving Early Stopping for Learning with Noisy Labels","date":"2021-06-30","arxiv_id":"2106.15853","n_code_links":1,"syntology":null},{"paper":"/paper/unsupervised-embedding-adaptation-via-early","slug":"unsupervised-embedding-adaptation-via-early","title":"Unsupervised Embedding Adaptation via Early-Stage Feature Reconstruction for Few-Shot Classification","date":"2021-06-22","arxiv_id":"2106.11486","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":1,"phrase":"1 ran (of which 1 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) · 0 unverified; the one sample that ran constructed an object rather than computing a result","official":{"repos":["movinghoon/ESFR"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"direct-reconstruction-of-linear-parametric","title":"Direct Reconstruction of Linear Parametric Images from Dynamic PET Using Nonlocal Deep Image Prior","date":"2021-06-18","arxiv_id":"2106.10359","n_code_links":0,"syntology":null},{"paper":null,"slug":"early-stopped-neural-networks-are-consistent","title":"Early-stopped neural networks are consistent","date":"2021-06-10","arxiv_id":"2106.05932","n_code_links":0,"syntology":null},{"paper":"/paper/safe-tests-and-always-valid-confidence","slug":"safe-tests-and-always-valid-confidence","title":"Generic E-Variables for Exact Sequential k-Sample Tests that allow for Optional Stopping","date":"2021-06-04","arxiv_id":"2106.02693","n_code_links":1,"syntology":null},{"paper":null,"slug":"double-descent-optimization-pattern-and","title":"Double Descent Optimization Pattern and Aliasing: Caveats of Noisy Labels","date":"2021-06-03","arxiv_id":"2106.02100","n_code_links":0,"syntology":null},{"paper":"/paper/optimization-variance-exploring-1","slug":"optimization-variance-exploring-1","title":"Optimization Variance: Exploring Generalization Properties of DNNs","date":"2021-06-03","arxiv_id":"2106.01714","n_code_links":1,"syntology":null},{"paper":"/paper/cascaded-diffusion-models-for-high-fidelity","slug":"cascaded-diffusion-models-for-high-fidelity","title":"Cascaded Diffusion Models for High Fidelity Image Generation","date":"2021-05-30","arxiv_id":"2106.15282","n_code_links":0,"syntology":null},{"paper":"/paper/scatterbrain-unifying-sparse-and-low-rank-1","slug":"scatterbrain-unifying-sparse-and-low-rank-1","title":"Scatterbrain: Unifying Sparse and Low-rank Attention","date":"2021-05-21","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"distributed-adaptive-nearest-neighbor","title":"Distributed Adaptive Nearest Neighbor Classifier: Algorithm and Theory","date":"2021-05-20","arxiv_id":"2105.09788","n_code_links":0,"syntology":null},{"paper":null,"slug":"theoretical-foundations-of-t-sne-for","title":"Theoretical Foundations of t-SNE for Visualizing High-Dimensional Clustered Data","date":"2021-05-16","arxiv_id":"2105.07536","n_code_links":0,"syntology":null},{"paper":null,"slug":"convergence-analysis-of-over-parameterized","title":"Principal Components Bias in Over-parameterized Linear Models, and its Manifestation in Deep Neural Networks","date":"2021-05-12","arxiv_id":"2105.05553","n_code_links":0,"syntology":null},{"paper":"/paper/nearly-minimax-optimal-rates-for-noisy-sparse","slug":"nearly-minimax-optimal-rates-for-noisy-sparse","title":"Nearly Minimax-Optimal Rates for Noisy Sparse Phase Retrieval via Early-Stopped Mirror Descent","date":"2021-05-08","arxiv_id":"2105.03678","n_code_links":1,"syntology":null},{"paper":null,"slug":"relating-adversarially-robust-generalization","title":"Relating Adversarially Robust Generalization to Flat Minima","date":"2021-04-09","arxiv_id":"2104.04448","n_code_links":0,"syntology":null},{"paper":"/paper/efficient-subsampling-for-generating-high","slug":"efficient-subsampling-for-generating-high","title":"Efficient Subsampling of Realistic Images From GANs Conditional on a Class or a Continuous Variable","date":"2021-03-20","arxiv_id":"2103.11166","n_code_links":1,"syntology":null},{"paper":null,"slug":"understanding-invariance-via-feedforward","title":"Understanding Invariance via Feedforward Inversion of Discriminatively Trained Classifiers","date":"2021-03-15","arxiv_id":"2103.07470","n_code_links":0,"syntology":null},{"paper":null,"slug":"use-of-static-surrogates-in-hyperparameter","title":"Use of static surrogates in hyperparameter optimization","date":"2021-03-14","arxiv_id":"2103.07963","n_code_links":0,"syntology":null},{"paper":"/paper/autocalibration-and-tweedie-dominance-for","slug":"autocalibration-and-tweedie-dominance-for","title":"Autocalibration and Tweedie-dominance for Insurance Pricing with Machine Learning","date":"2021-03-05","arxiv_id":"2103.03635","n_code_links":1,"syntology":null},{"paper":"/paper/ultra-data-efficient-gan-training-drawing-a","slug":"ultra-data-efficient-gan-training-drawing-a","title":"Data-Efficient GAN Training Beyond (Just) Augmentations: A Lottery Ticket Perspective","date":"2021-02-28","arxiv_id":"2103.00397","n_code_links":1,"syntology":null},{"paper":null,"slug":"complex-momentum-for-learning-in-games","title":"Complex Momentum for Optimization in Games","date":"2021-02-16","arxiv_id":"2102.08431","n_code_links":0,"syntology":null},{"paper":"/paper/on-mathews-correlation-coefficient-and","slug":"on-mathews-correlation-coefficient-and","title":"On Mathews Correlation Coefficient and Improved Distance Map Loss for Automatic Glacier Calving Front Segmentation in SAR Imagery","date":"2021-02-16","arxiv_id":"2102.08312","n_code_links":1,"syntology":null},{"paper":"/paper/scan-specific-mri-reconstruction-using-zero","slug":"scan-specific-mri-reconstruction-using-zero","title":"Zero-Shot Self-Supervised Learning for MRI Reconstruction","date":"2021-02-15","arxiv_id":"2102.07737","n_code_links":1,"syntology":null},{"paper":"/paper/on-the-connection-of-benford-s-law-and-neural","slug":"on-the-connection-of-benford-s-law-and-neural","title":"Rethinking Neural Networks With Benford's Law","date":"2021-02-05","arxiv_id":"2102.03313","n_code_links":1,"syntology":null},{"paper":"/paper/generating-images-from-caption-and-vice-versa","slug":"generating-images-from-caption-and-vice-versa","title":"Generating images from caption and vice versa via CLIP-Guided Generative Latent Space Search","date":"2021-02-02","arxiv_id":"2102.01645","n_code_links":3,"syntology":null},{"paper":"/paper/gan-inversion-a-survey","slug":"gan-inversion-a-survey","title":"GAN Inversion: A Survey","date":"2021-01-14","arxiv_id":"2101.05278","n_code_links":1,"syntology":null},{"paper":"/paper/a-geometric-analysis-of-deep-generative-image","slug":"a-geometric-analysis-of-deep-generative-image","title":"A Geometric Analysis of Deep Generative Image Models and Its Applications","date":"2021-01-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/naturalistic-physical-adversarial-patch-for","slug":"naturalistic-physical-adversarial-patch-for","title":"Naturalistic Physical Adversarial Patch for Object Detectors","date":"2021-01-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"not-so-big-gan-generating-high-fidelity","title":"not-so-big-GAN: Generating High-Fidelity Images on Small Compute with Wavelet-based Super-Resolution","date":"2021-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"pyramid-architecture-search-for-real-time","title":"Pyramid Architecture Search for Real-Time Image Deblurring","date":"2021-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/robust-early-learning-hindering-the","slug":"robust-early-learning-hindering-the","title":"Robust early-learning: Hindering the memorization of noisy labels","date":"2021-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"identifying-training-stop-point-with-noisy","title":"Identifying Training Stop Point with Noisy Labeled Data","date":"2020-12-24","arxiv_id":"2012.13435","n_code_links":0,"syntology":null},{"paper":null,"slug":"amazon-sagemaker-automatic-model-tuning","title":"Amazon SageMaker Automatic Model Tuning: Scalable Gradient-Free Optimization","date":"2020-12-15","arxiv_id":"2012.08489","n_code_links":0,"syntology":null},{"paper":"/paper/avoiding-the-double-descent-phenomenon-of","slug":"avoiding-the-double-descent-phenomenon-of","title":"Avoiding The Double Descent Phenomenon of Random Feature Models Using Hybrid Regularization","date":"2020-12-11","arxiv_id":"2012.06667","n_code_links":1,"syntology":null},{"paper":null,"slug":"stronger-calibration-lower-bounds-via","title":"Stronger Calibration Lower Bounds via Sidestepping","date":"2020-12-07","arxiv_id":"2012.03454","n_code_links":0,"syntology":null},{"paper":"/paper/adaptive-weighted-discriminator-for-training","slug":"adaptive-weighted-discriminator-for-training","title":"Adaptive Weighted Discriminator for Training Generative Adversarial Networks","date":"2020-12-05","arxiv_id":"2012.03149","n_code_links":3,"syntology":null},{"paper":"/paper/mfes-hb-efficient-hyperband-with-multi","slug":"mfes-hb-efficient-hyperband-with-multi","title":"MFES-HB: Efficient Hyperband with Multi-Fidelity Quality Measurements","date":"2020-12-05","arxiv_id":"2012.03011","n_code_links":5,"syntology":null},{"paper":"/paper/generalization-bound-of-gradient-descent-for","slug":"generalization-bound-of-gradient-descent-for","title":"Generalization Bound of Gradient Descent for Non-Convex Metric Learning","date":"2020-12-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/grubert-a-gru-based-method-to-fuse-bert","slug":"grubert-a-gru-based-method-to-fuse-bert","title":"GRUBERT: A GRU-Based Method to Fuse BERT Hidden Layers for Twitter Sentiment Analysis","date":"2020-12-01","arxiv_id":null,"n_code_links":2,"syntology":null},{"paper":"/paper/smyrf-efficient-attention-using-asymmetric-1","slug":"smyrf-efficient-attention-using-asymmetric-1","title":"SMYRF - Efficient Attention using Asymmetric Clustering","date":"2020-12-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"generalization-and-memorization-the-bias","title":"Generalization and Memorization: The Bias Potential Model","date":"2020-11-29","arxiv_id":"2011.14269","n_code_links":0,"syntology":null},{"paper":null,"slug":"gradient-descent-for-deep-matrix","title":"Gradient Descent for Deep Matrix Factorization: Dynamics and Implicit Bias towards Low Rank","date":"2020-11-27","arxiv_id":"2011.13772","n_code_links":0,"syntology":null},{"paper":"/paper/omni-gan-on-the-secrets-of-cgans-and-beyond","slug":"omni-gan-on-the-secrets-of-cgans-and-beyond","title":"Omni-GAN: On the Secrets of cGANs and Beyond","date":"2020-11-26","arxiv_id":"2011.13074","n_code_links":3,"syntology":null},{"paper":null,"slug":"recursive-deep-prior-video-a-super-resolution","title":"Recursive Deep Prior Video: a Super Resolution algorithm for Time-Lapse Microscopy of organ-on-chip experiments","date":"2020-11-19","arxiv_id":"2011.09855","n_code_links":0,"syntology":null},{"paper":"/paper/deepi2i-enabling-deep-hierarchical-image-to","slug":"deepi2i-enabling-deep-hierarchical-image-to","title":"DeepI2I: Enabling Deep Hierarchical Image-to-Image Translation by Transferring from GANs","date":"2020-11-11","arxiv_id":"2011.05867","n_code_links":1,"syntology":null},{"paper":null,"slug":"ensembled-ctr-prediction-via-knowledge","title":"Ensemble Knowledge Distillation for CTR Prediction","date":"2020-11-08","arxiv_id":"2011.04106","n_code_links":0,"syntology":null},{"paper":null,"slug":"direction-matters-on-the-implicit-1","title":"Direction Matters: On the Implicit Bias of Stochastic Gradient Descent with Moderate Learning Rate","date":"2020-11-04","arxiv_id":"2011.02538","n_code_links":0,"syntology":null},{"paper":"/paper/a-comparative-study-on-efficiencies-of","slug":"a-comparative-study-on-efficiencies-of","title":"A Comparative Study on Efficiencies of Variants of Convolutional Neural Networks based on Image Classification Task","date":"2020-10-15","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"conditioning-trick-for-training-stable-gans-1","title":"Conditioning Trick for Training Stable GANs","date":"2020-10-12","arxiv_id":"2010.05844","n_code_links":0,"syntology":null},{"paper":"/paper/panda-adapting-pretrained-features-for","slug":"panda-adapting-pretrained-features-for","title":"PANDA: Adapting Pretrained Features for Anomaly Detection and Segmentation","date":"2020-10-12","arxiv_id":"2010.05903","n_code_links":1,"syntology":null},{"paper":"/paper/smyrf-efficient-attention-using-asymmetric","slug":"smyrf-efficient-attention-using-asymmetric","title":"SMYRF: Efficient Attention using Asymmetric Clustering","date":"2020-10-11","arxiv_id":"2010.05315","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":0,"n_instrument":3,"unverified":0,"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","official":{"repos":["giannisdaras/smyrf"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]}}},{"paper":"/paper/logan-local-group-bias-detection-by","slug":"logan-local-group-bias-detection-by","title":"LOGAN: Local Group Bias Detection by Clustering","date":"2020-10-06","arxiv_id":"2010.02867","n_code_links":1,"syntology":null},{"paper":"/paper/bag-of-tricks-for-adversarial-training","slug":"bag-of-tricks-for-adversarial-training","title":"Bag of Tricks for Adversarial Training","date":"2020-10-01","arxiv_id":"2010.00467","n_code_links":2,"syntology":{"ran":2,"of":3,"n_ran_checked":1,"n_instrument":1,"unverified":1,"pointer_only":2,"phrase":"2 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; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["P2333/Bag-of-Tricks-for-AT","fra31/auto-attack"],"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","unlocated"]}}},{"paper":"/paper/tinygan-distilling-biggan-for-conditional","slug":"tinygan-distilling-biggan-for-conditional","title":"TinyGAN: Distilling BigGAN for Conditional Image Generation","date":"2020-09-29","arxiv_id":"2009.13829","n_code_links":1,"syntology":null},{"paper":null,"slug":"not-so-biggan-generating-high-fidelity-images","title":"not-so-BigGAN: Generating High-Fidelity Images on Small Compute with Wavelet-based Super-Resolution","date":"2020-09-09","arxiv_id":"2009.04433","n_code_links":0,"syntology":null},{"paper":"/paper/minimum-discrepancy-principle-strategy-for","slug":"minimum-discrepancy-principle-strategy-for","title":"Minimum discrepancy principle strategy for choosing $k$ in $k$-NN regression","date":"2020-08-20","arxiv_id":"2008.08718","n_code_links":1,"syntology":null},{"paper":null,"slug":"to-bag-is-to-prune","title":"To Bag is to Prune","date":"2020-08-17","arxiv_id":"2008.07063","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-functional-model-for-structure-learning-and","title":"A Functional Model for Structure Learning and Parameter Estimation in Continuous Time Bayesian Network: An Application in Identifying Patterns of Multiple Chronic Conditions","date":"2020-07-31","arxiv_id":"2007.15847","n_code_links":0,"syntology":null},{"paper":"/paper/instance-selection-for-gans","slug":"instance-selection-for-gans","title":"Instance Selection for GANs","date":"2020-07-30","arxiv_id":"2007.15255","n_code_links":2,"syntology":{"ran":11,"of":19,"n_ran_checked":5,"n_instrument":6,"unverified":8,"pointer_only":19,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 5 honoured, 0 violated, 0 with no contract checked; 6 where Syntology's instrument failed) · 8 unverified","official":{"repos":["uoguelph-mlrg/instance_selection_for_gans"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"paper":null,"slug":"interpolating-gans-to-scaffold-autotelic","title":"Interpolating GANs to Scaffold Autotelic Creativity","date":"2020-07-21","arxiv_id":"2007.11119","n_code_links":0,"syntology":null},{"paper":"/paper/early-stopping-in-deep-networks-double","slug":"early-stopping-in-deep-networks-double","title":"Early Stopping in Deep Networks: Double Descent and How to Eliminate it","date":"2020-07-20","arxiv_id":"2007.10099","n_code_links":1,"syntology":null},{"paper":null,"slug":"allpass-feedback-delay-networks","title":"Allpass Feedback Delay Networks","date":"2020-07-14","arxiv_id":"2007.07337","n_code_links":0,"syntology":null},{"paper":"/paper/automated-synthetic-to-real-generalization","slug":"automated-synthetic-to-real-generalization","title":"Automated Synthetic-to-Real Generalization","date":"2020-07-14","arxiv_id":"2007.06965","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":0,"n_instrument":2,"unverified":0,"pointer_only":2,"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) · 0 unverified","official":{"repos":["NVlabs/ASG"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"early-stopping-and-polynomial-smoothing-in","title":"Early stopping and polynomial smoothing in regression with reproducing kernels","date":"2020-07-14","arxiv_id":"2007.06827","n_code_links":0,"syntology":null},{"paper":null,"slug":"improving-p300-speller-performance-by-means","title":"Improving P300 Speller performance by means of optimization and machine learning","date":"2020-07-13","arxiv_id":"2007.06411","n_code_links":0,"syntology":null},{"paper":"/paper/estimating-generalization-under-distribution","slug":"estimating-generalization-under-distribution","title":"Estimating Generalization under Distribution Shifts via Domain-Invariant Representations","date":"2020-07-06","arxiv_id":"2007.03511","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":1,"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) · 0 unverified","official":{"repos":["chingyaoc/estimating-generalization"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"on-dropout-overfitting-and-interaction","title":"Dropout as a Regularizer of Interaction Effects","date":"2020-07-02","arxiv_id":"2007.00823","n_code_links":0,"syntology":null},{"paper":null,"slug":"particle-swarm-optimization-for-energy","title":"Particle Swarm Optimization for Energy Disaggregation in Industrial and Commercial Buildings","date":"2020-06-23","arxiv_id":"2006.12940","n_code_links":0,"syntology":null},{"paper":"/paper/differentiable-augmentation-for-data","slug":"differentiable-augmentation-for-data","title":"Differentiable Augmentation for Data-Efficient GAN Training","date":"2020-06-18","arxiv_id":"2006.10738","n_code_links":13,"syntology":{"ran":49,"of":58,"n_ran_checked":19,"n_instrument":30,"unverified":9,"pointer_only":15,"phrase":"49 ran (of which 0 constructed an object rather than computing a result; 19 with no instrument failure: 2 honoured, 1 violated, 16 with no contract checked; 30 where Syntology's instrument failed) · 9 unverified","official":{"repos":["mit-han-lab/data-efficient-gans"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/training-generative-adversarial-networks-with-2","slug":"training-generative-adversarial-networks-with-2","title":"Training Generative Adversarial Networks with Limited Data","date":"2020-06-11","arxiv_id":"2006.06676","n_code_links":28,"syntology":{"ran":21,"of":29,"n_ran_checked":20,"n_instrument":1,"unverified":8,"pointer_only":5,"phrase":"21 ran (of which 0 constructed an object rather than computing a result; 20 with no instrument failure: 2 honoured, 1 violated, 17 with no contract checked; 1 where Syntology's instrument failed) · 8 unverified","official":{"repos":["NVlabs/stylegan2-ada"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]}}},{"paper":"/paper/big-gans-are-watching-you-towards","slug":"big-gans-are-watching-you-towards","title":"Object Segmentation Without Labels with Large-Scale Generative Models","date":"2020-06-08","arxiv_id":"2006.04988","n_code_links":1,"syntology":null},{"paper":null,"slug":"learning-disconnected-manifolds-a-no-gans","title":"Learning disconnected manifolds: a no GANs land","date":"2020-06-08","arxiv_id":"2006.04596","n_code_links":0,"syntology":null},{"paper":"/paper/revisiting-the-train-loss-an-efficient","slug":"revisiting-the-train-loss-an-efficient","title":"Speedy Performance Estimation for Neural Architecture Search","date":"2020-06-08","arxiv_id":"2006.04492","n_code_links":2,"syntology":{"ran":1,"of":2,"n_ran_checked":1,"n_instrument":0,"unverified":1,"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) · 1 unverified","official":{"repos":["rubinxin/TSE"],"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"]}}},{"paper":"/paper/a-u-net-based-discriminator-for-generative-1","slug":"a-u-net-based-discriminator-for-generative-1","title":"A U-Net Based Discriminator for Generative Adversarial Networks","date":"2020-06-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"consistent-second-order-conic-integer","title":"Consistent Second-Order Conic Integer Programming for Learning Bayesian Networks","date":"2020-05-29","arxiv_id":"2005.14346","n_code_links":0,"syntology":null},{"paper":"/paper/network-fusion-for-content-creation-with","slug":"network-fusion-for-content-creation-with","title":"Network-to-Network Translation with Conditional Invertible Neural Networks","date":"2020-05-27","arxiv_id":"2005.13580","n_code_links":1,"syntology":null},{"paper":"/paper/compressive-sensing-with-un-trained-neural","slug":"compressive-sensing-with-un-trained-neural","title":"Compressive sensing with un-trained neural networks: Gradient descent finds the smoothest approximation","date":"2020-05-07","arxiv_id":"2005.03991","n_code_links":1,"syntology":null},{"paper":"/paper/drawing-early-bird-tickets-toward-more","slug":"drawing-early-bird-tickets-toward-more","title":"Drawing Early-Bird Tickets: Toward More Efficient Training of Deep Networks","date":"2020-05-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/scirex-a-challenge-dataset-for-document-level","slug":"scirex-a-challenge-dataset-for-document-level","title":"SciREX: A Challenge Dataset for Document-Level Information Extraction","date":"2020-05-01","arxiv_id":"2005.00512","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":0,"n_instrument":2,"unverified":0,"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) · 0 unverified","official":{"repos":["allenai/SciREX"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"query-level-early-exit-for-additive-learning","title":"Query-level Early Exit for Additive Learning-to-Rank Ensembles","date":"2020-04-30","arxiv_id":"2004.14641","n_code_links":0,"syntology":null},{"paper":null,"slug":"analyzing-the-discrepancy-principle-for","title":"Analyzing the discrepancy principle for kernelized spectral filter learning algorithms","date":"2020-04-17","arxiv_id":"2004.08436","n_code_links":0,"syntology":null},{"paper":"/paper/evolving-normalization-activation-layers","slug":"evolving-normalization-activation-layers","title":"Evolving Normalization-Activation Layers","date":"2020-04-06","arxiv_id":"2004.02967","n_code_links":8,"syntology":{"ran":3,"of":5,"n_ran_checked":0,"n_instrument":3,"unverified":2,"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) · 2 unverified","official":null}},{"paper":"/paper/ganspace-discovering-interpretable-gan","slug":"ganspace-discovering-interpretable-gan","title":"GANSpace: Discovering Interpretable GAN Controls","date":"2020-04-06","arxiv_id":"2004.02546","n_code_links":2,"syntology":{"ran":3,"of":4,"n_ran_checked":0,"n_instrument":3,"unverified":1,"pointer_only":0,"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) · 1 unverified","official":{"repos":["harskish/ganspace"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/feature-quantization-improves-gan-training","slug":"feature-quantization-improves-gan-training","title":"Feature Quantization Improves GAN Training","date":"2020-04-05","arxiv_id":"2004.02088","n_code_links":2,"syntology":{"ran":3,"of":4,"n_ran_checked":3,"n_instrument":0,"unverified":1,"pointer_only":1,"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) · 1 unverified","official":{"repos":["YangNaruto/FQ-GAN"],"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":["found_in_text","official"]}}},{"paper":null,"slug":"fully-corrective-gradient-boosting-with","title":"Fully-Corrective Gradient Boosting with Squared Hinge: Fast Learning Rates and Early Stopping","date":"2020-04-01","arxiv_id":"2004.00179","n_code_links":0,"syntology":null},{"paper":"/paper/milenas-efficient-neural-architecture-search","slug":"milenas-efficient-neural-architecture-search","title":"MiLeNAS: Efficient Neural Architecture Search via Mixed-Level Reformulation","date":"2020-03-27","arxiv_id":"2003.12238","n_code_links":1,"syntology":null},{"paper":null,"slug":"improving-adversarial-robustness-through","title":"SAT: Improving Adversarial Training via Curriculum-Based Loss Smoothing","date":"2020-03-18","arxiv_id":"2003.09347","n_code_links":0,"syntology":null},{"paper":null,"slug":"biggan-based-bayesian-reconstruction-of","title":"BigGAN-based Bayesian reconstruction of natural images from human brain activity","date":"2020-03-13","arxiv_id":"2003.06105","n_code_links":0,"syntology":null},{"paper":"/paper/transformation-based-adversarial-video","slug":"transformation-based-adversarial-video","title":"Transformation-based Adversarial Video Prediction on Large-Scale Data","date":"2020-03-09","arxiv_id":"2003.04035","n_code_links":0,"syntology":null},{"paper":"/paper/non-stationary-neural-network-for-stock","slug":"non-stationary-neural-network-for-stock","title":"Time-varying neural network for stock return prediction","date":"2020-03-05","arxiv_id":"2003.02515","n_code_links":1,"syntology":null},{"paper":"/paper/a-u-net-based-discriminator-for-generative","slug":"a-u-net-based-discriminator-for-generative","title":"A U-Net Based Discriminator for Generative Adversarial Networks","date":"2020-02-28","arxiv_id":"2002.12655","n_code_links":3,"syntology":null},{"paper":null,"slug":"bounding-the-expected-run-time-of-nonconvex","title":"Bounding the expected run-time of nonconvex optimization with early stopping","date":"2020-02-20","arxiv_id":"2002.08856","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-not-to-learn-in-the-presence-of","title":"Learning Not to Learn in the Presence of Noisy Labels","date":"2020-02-16","arxiv_id":"2002.06541","n_code_links":0,"syntology":null},{"paper":"/paper/the-differentially-private-lottery-ticket","slug":"the-differentially-private-lottery-ticket","title":"The Differentially Private Lottery Ticket Mechanism","date":"2020-02-16","arxiv_id":"2002.11613","n_code_links":1,"syntology":null}],"record_sha256":"c5bdc6269bb2e11f209d4f584deba7f4a5c1a0c60a293e35653035018c6be7f5","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}