{"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/open-question/papers/7","list_of":"/task/open-question","task":"Open-Ended Question Answering","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":7,"pages_in_order":8,"rows_per_page":100,"rows":[601,700],"of":796,"counts":{"archive_papers_tagged":796,"with_a_code_link":228,"where_syntology_ran_a_sample":70,"not_listed_spam_title":0,"listed":796,"listed_where_code_ran":70,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":59,"every_run_a_failure_of_syntologys_instrument":11,"listed_with_a_run_with_no_instrument_failure":59,"listed_every_run_a_failure_of_syntologys_instrument":11,"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/open-question","prev":"/task/open-question/papers/6","next":"/task/open-question/papers/8","papers":[{"url":null,"slug":"nonrobustness-of-asymptotic-stability-of","title":"Nonrobustness of asymptotic stability of impulsive systems with inputs","date":"2019-10-16","arxiv_id":"1910.07610","repositories_listed":0,"syntology":null},{"url":null,"slug":"thompson-sampling-in-non-episodic-restless","title":"Thompson Sampling in Non-Episodic Restless Bandits","date":"2019-10-12","arxiv_id":"1910.05654","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-does-the-mind-store-information","title":"How does the Mind store Information?","date":"2019-10-03","arxiv_id":"1910.06718","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-universal-approximation-by-neural-networks","title":"On Universal Approximation by Neural Networks with Uniform Guarantees on Approximation of Infinite Dimensional Maps","date":"2019-10-03","arxiv_id":"1910.01545","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-a-metric-for-automated-conversational","title":"Towards a Metric for Automated Conversational Dialogue System Evaluation and Improvement","date":"2019-09-26","arxiv_id":"1909.12066","repositories_listed":0,"syntology":null},{"url":null,"slug":"active-learning-graph-neural-networks-via","title":"Active Learning Graph Neural Networks via Node Feature Propagation","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"coresets-for-accelerating-incremental","title":"Coresets for Accelerating Incremental Gradient Methods","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"feature-robustness-flatness-and","title":"Feature-Robustness, Flatness and Generalization Error for Deep Neural Networks","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"model-free-learning-control-of-nonlinear","title":"Model-free Learning Control of Nonlinear Stochastic Systems with Stability Guarantee","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"where-is-the-information-in-a-deep-network","title":"Where is the Information in a Deep Network?","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"slices-of-attention-in-asynchronous-video-job","title":"Slices of Attention in Asynchronous Video Job Interviews","date":"2019-09-19","arxiv_id":"1909.08845","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-convergence-proof-of-projected-fast","title":"A Guaranteed Convergence Analysis for the Projected Fast Iterative Soft-Thresholding Algorithm in Parallel MRI","date":"2019-09-17","arxiv_id":"1909.07600","repositories_listed":0,"syntology":null},{"url":null,"slug":"dashnet-a-hybrid-artificial-and-spiking","title":"DashNet: A Hybrid Artificial and Spiking Neural Network for High-speed Object Tracking","date":"2019-09-15","arxiv_id":"1909.12942","repositories_listed":0,"syntology":null},{"url":null,"slug":"kernel-absolute-summability-is-only","title":"Kernel absolute summability is only sufficient for RKHS stability","date":"2019-09-05","arxiv_id":"1909.02341","repositories_listed":0,"syntology":null},{"url":null,"slug":"ensemble-based-deep-reinforcement-learning","title":"Ensemble-Based Deep Reinforcement Learning for Chatbots","date":"2019-08-27","arxiv_id":"1908.10422","repositories_listed":0,"syntology":null},{"url":null,"slug":"chromosomal-rearrangements-as-a-source-of-new","title":"Chromosomal rearrangements as a source of new gene formation in Drosophila yakuba","date":"2019-08-15","arxiv_id":"1806.02205","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-machine-translation-with-noisy-lexical","title":"Neural Machine Translation with Noisy Lexical Constraints","date":"2019-08-13","arxiv_id":"1908.04664","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-video-precoding","title":"Deep Video Precoding","date":"2019-08-02","arxiv_id":"1908.00812","repositories_listed":0,"syntology":null},{"url":null,"slug":"weakly-deterministic-transformations-are","title":"Weakly deterministic transformations are subregular","date":"2019-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"can-machine-learning-identify-governing-laws","title":"Can Machine Learning Identify Governing Laws For Dynamics in Complex Engineered Systems ? : A Study in Chemical Engineering","date":"2019-07-18","arxiv_id":"1907.07755","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-neural-network-detector-for-spectrum","title":"A Neural Network Detector for Spectrum Sensing under Uncertainties","date":"2019-07-15","arxiv_id":"1907.07326","repositories_listed":0,"syntology":null},{"url":null,"slug":"computational-concentration-of-measure","title":"Computational Concentration of Measure: Optimal Bounds, Reductions, and More","date":"2019-07-11","arxiv_id":"1907.05401","repositories_listed":0,"syntology":null},{"url":null,"slug":"global-aggregations-of-local-explanations-for","title":"Global Aggregations of Local Explanations for Black Box models","date":"2019-07-05","arxiv_id":"1907.03039","repositories_listed":0,"syntology":null},{"url":null,"slug":"distribution-independent-pac-learning-of","title":"Distribution-Independent PAC Learning of Halfspaces with Massart Noise","date":"2019-06-24","arxiv_id":"1906.10075","repositories_listed":0,"syntology":null},{"url":null,"slug":"investigating-bert-s-knowledge-of-language","title":"Investigating BERT's Knowledge of Language: Five Analysis Methods with NPIs","date":"2019-06-24","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"is-the-policy-gradient-a-gradient","title":"Is the Policy Gradient a Gradient?","date":"2019-06-17","arxiv_id":"1906.07073","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-syntax-aware-language-models-using","title":"Scalable Syntax-Aware Language Models Using Knowledge Distillation","date":"2019-06-14","arxiv_id":"1906.06438","repositories_listed":0,"syntology":null},{"url":null,"slug":"hierarchical-representation-in-neural","title":"Hierarchical Representation in Neural Language Models: Suppression and Recovery of Expectations","date":"2019-06-10","arxiv_id":"1906.04068","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-gradient-based-attacks-with","title":"Enhancing Gradient-based Attacks with Symbolic Intervals","date":"2019-06-05","arxiv_id":"1906.02282","repositories_listed":0,"syntology":null},{"url":null,"slug":"autonomous-reinforcement-learning-of-multiple","title":"Autonomous Reinforcement Learning of Multiple Interrelated Tasks","date":"2019-06-04","arxiv_id":"1906.01374","repositories_listed":0,"syntology":null},{"url":null,"slug":"190600182","title":"Average-case Analysis of the Assignment Problem with Independent Preferences","date":"2019-06-01","arxiv_id":"1906.00182","repositories_listed":0,"syntology":null},{"url":null,"slug":"semeval-2019-task-4-hyperpartisan-news","title":"SemEval-2019 Task 4: Hyperpartisan News Detection","date":"2019-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"where-is-the-information-in-a-deep-neural","title":"Where is the Information in a Deep Neural Network?","date":"2019-05-29","arxiv_id":"1905.12213","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-neuro-ai-interface-learning-dnns-from-the","title":"A Neuro-AI Interface: Learning DNNs from the Human Brain","date":"2019-05-28","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"end-to-end-pore-extraction-and-matching-in","title":"End-to-End Pore Extraction and Matching in Latent Fingerprints: Going Beyond Minutiae","date":"2019-05-27","arxiv_id":"1905.11472","repositories_listed":0,"syntology":null},{"url":null,"slug":"private-learning-implies-online-learning-an","title":"Private Learning Implies Online Learning: An Efficient Reduction","date":"2019-05-27","arxiv_id":"1905.11311","repositories_listed":0,"syntology":null},{"url":"/paper/a-comprehensive-study-of-imagenet-pre","slug":"a-comprehensive-study-of-imagenet-pre","title":"A Comprehensive Study of ImageNet Pre-Training for Historical Document Image Analysis","date":"2019-05-22","arxiv_id":"1905.09113","repositories_listed":0,"syntology":null},{"url":null,"slug":"shaping-the-learning-landscape-in-neural","title":"Shaping the learning landscape in neural networks around wide flat minima","date":"2019-05-20","arxiv_id":"1905.07833","repositories_listed":0,"syntology":null},{"url":null,"slug":"tight-kernel-query-complexity-of-kernel-ridge","title":"Tight Kernel Query Complexity of Kernel Ridge Regression and Kernel $k$-means Clustering","date":"2019-05-15","arxiv_id":"1905.06394","repositories_listed":0,"syntology":null},{"url":null,"slug":"autonomous-open-ended-learning-of","title":"Autonomous Open-Ended Learning of Interdependent Tasks","date":"2019-05-07","arxiv_id":"1905.02690","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantification-of-nematic-cell-polarity-in","title":"Quantification of Nematic Cell Polarity in Three-dimensional Tissues","date":"2019-04-18","arxiv_id":"1904.08886","repositories_listed":0,"syntology":null},{"url":null,"slug":"synthetic-neural-vision-system-design-for","title":"Synthetic Neural Vision System Design for Motion Pattern Recognition in Dynamic Robot Scenes","date":"2019-04-15","arxiv_id":"1904.07180","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-analysis-of-the-cost-of-hyper-parameter","title":"An analysis of the cost of hyper-parameter selection via split-sample validation, with applications to penalized regression","date":"2019-03-28","arxiv_id":"1903.12297","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-linear-quadratic-regulators","title":"Learning Linear-Quadratic Regulators Efficiently with only $\\sqrt{T}$ Regret","date":"2019-02-17","arxiv_id":"1902.06223","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploring-frame-segmentation-networks-for","title":"Exploring Frame Segmentation Networks for Temporal Action Localization","date":"2019-02-14","arxiv_id":"1902.05488","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-divergence-based-approach-to-clustering","title":"Deep Divergence-Based Approach to Clustering","date":"2019-02-13","arxiv_id":"1902.04981","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-theory-of-selective-prediction","title":"A Theory of Selective Prediction","date":"2019-02-12","arxiv_id":"1902.04256","repositories_listed":0,"syntology":null},{"url":null,"slug":"new-algorithms-for-multiplayer-bandits-when","title":"A Practical Algorithm for Multiplayer Bandits when Arm Means Vary Among Players","date":"2019-02-04","arxiv_id":"1902.01239","repositories_listed":0,"syntology":null},{"url":null,"slug":"tracknet-simultaneous-object-detection-and","title":"TrackNet: Simultaneous Object Detection and Tracking and Its Application in Traffic Video Analysis","date":"2019-02-04","arxiv_id":"1902.01466","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-importance-of-socio-cultural-differences","title":"The Importance of Socio-Cultural Differences for Annotating and Detecting the Affective States of Students","date":"2019-01-12","arxiv_id":"1901.03793","repositories_listed":0,"syntology":null},{"url":null,"slug":"using-scene-graph-context-to-improve-image","title":"Using Scene Graph Context to Improve Image Generation","date":"2019-01-11","arxiv_id":"1901.03762","repositories_listed":0,"syntology":null},{"url":null,"slug":"uncertainty-based-out-of-distribution","title":"Uncertainty-Based Out-of-Distribution Detection in Deep Reinforcement Learning","date":"2019-01-08","arxiv_id":"1901.02219","repositories_listed":0,"syntology":null},{"url":null,"slug":"santis-sampling-augmented-neural-network-with","title":"SANTIS: Sampling-Augmented Neural neTwork with Incoherent Structure for MR image reconstruction","date":"2018-12-08","arxiv_id":"1812.03278","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-based-security-and-privacy-analytics","title":"Graph-based Security and Privacy Analytics via Collective Classification with Joint Weight Learning and Propagation","date":"2018-12-04","arxiv_id":"1812.01661","repositories_listed":0,"syntology":null},{"url":null,"slug":"new-insight-into-hybrid-stochastic-gradient","title":"New Insight into Hybrid Stochastic Gradient Descent: Beyond With-Replacement Sampling and Convexity","date":"2018-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"pac-learning-in-the-presence-of-adversaries","title":"PAC-learning in the presence of adversaries","date":"2018-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-scale-variability-in-neuronal","title":"Multi-scale variability in neuronal competition","date":"2018-11-16","arxiv_id":"1811.07012","repositories_listed":0,"syntology":null},{"url":null,"slug":"nonlinear-dimension-reduction-via-outer-bi","title":"Nonlinear Dimension Reduction via Outer Bi-Lipschitz Extensions","date":"2018-11-08","arxiv_id":"1811.03591","repositories_listed":0,"syntology":null},{"url":null,"slug":"depth-with-nonlinearity-creates-no-bad-local","title":"Depth with Nonlinearity Creates No Bad Local Minima in ResNets","date":"2018-10-21","arxiv_id":"1810.09038","repositories_listed":0,"syntology":null},{"url":null,"slug":"effective-parallelisation-for-machine","title":"Effective Parallelisation for Machine Learning","date":"2018-10-08","arxiv_id":"1810.03530","repositories_listed":0,"syntology":null},{"url":null,"slug":"agnostic-sample-compression-for-linear","title":"Agnostic Sample Compression Schemes for Regression","date":"2018-10-03","arxiv_id":"1810.01864","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-adaptive-learning-for-writer","title":"Deep Adaptive Learning for Writer Identification based on Single Handwritten Word Images","date":"2018-09-28","arxiv_id":"1809.10954","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-binary-functional-search-on-graph","title":"Fast Binary Functional Search on Graph","date":"2018-09-27","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-joint-wasserstein-auto-encoders-for","title":"Learning Joint Wasserstein Auto-Encoders for Joint Distribution Matching","date":"2018-09-27","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"discovering-features-in-sr_14cu_24o_41","title":"Discovering Features in Sr$_{14}$Cu$_{24}$O$_{41}$ Neutron Single Crystal Diffraction Data by Cluster Analysis","date":"2018-09-13","arxiv_id":"1809.05039","repositories_listed":0,"syntology":null},{"url":null,"slug":"acquiring-annotated-data-with-cross-lingual","title":"Acquiring Annotated Data with Cross-lingual Explicitation for Implicit Discourse Relation Classification","date":"2018-08-30","arxiv_id":"1808.10290","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-bayesian-active-learning-for-natural","title":"Deep Bayesian Active Learning for Natural Language Processing: Results of a Large-Scale Empirical Study","date":"2018-08-16","arxiv_id":"1808.05697","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-impact-of-automatic-pre-annotation-in","title":"The Impact of Automatic Pre-annotation in Clinical Note Data Element Extraction - the CLEAN Tool","date":"2018-08-11","arxiv_id":"1808.03806","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-human-like-semantic-representations","title":"Efficient human-like semantic representations via the Information Bottleneck principle","date":"2018-08-09","arxiv_id":"1808.03353","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-convergence-of-a-class-of-adam-type","title":"On the Convergence of A Class of Adam-Type Algorithms for Non-Convex Optimization","date":"2018-08-08","arxiv_id":"1808.02941","repositories_listed":0,"syntology":null},{"url":null,"slug":"hierarchical-clustering-better-than-average","title":"Hierarchical Clustering better than Average-Linkage","date":"2018-08-07","arxiv_id":"1808.02227","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-empirical-study-on-fine-grained-named","title":"An Empirical Study on Fine-Grained Named Entity Recognition","date":"2018-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"finite-state-reasoning-for-presupposition","title":"Finite State Reasoning for Presupposition Satisfaction","date":"2018-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-bounds-on-the-vc-dimension","title":"Optimal Bounds on the VC-dimension","date":"2018-07-20","arxiv_id":"1807.07924","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-occlusion-uniformly-partitions-red","title":"Optimal occlusion uniformly partitions red blood cells fluxes within a microvascular network","date":"2018-07-13","arxiv_id":"1512.04184","repositories_listed":0,"syntology":null},{"url":null,"slug":"last-iterate-convergence-zero-sum-games-and","title":"Last-Iterate Convergence: Zero-Sum Games and Constrained Min-Max Optimization","date":"2018-07-11","arxiv_id":"1807.04252","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-reinforcement-learning-for-doom-using","title":"Deep Reinforcement Learning for Doom using Unsupervised Auxiliary Tasks","date":"2018-07-05","arxiv_id":"1807.01960","repositories_listed":0,"syntology":null},{"url":null,"slug":"equivalence-of-multicategory-svm-and-simplex","title":"Equivalence of Multicategory SVM and Simplex Cone SVM: Fast Computations and Statistical Theory","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"quantity-beats-quality-for-semantic","title":"Quantity beats quality for semantic segmentation of corrosion in images","date":"2018-06-30","arxiv_id":"1807.03138","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-complexity-of-detecting-convexity-over","title":"On the Complexity of Detecting Convexity over a Box","date":"2018-06-16","arxiv_id":"1806.06173","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-much-income-inequality-is-fair-nash","title":"How much income inequality is fair? Nash bargaining solution and its connection to entropy","date":"2018-06-13","arxiv_id":"1806.05262","repositories_listed":0,"syntology":null},{"url":null,"slug":"conditional-noise-contrastive-estimation-of","title":"Conditional Noise-Contrastive Estimation of Unnormalised Models","date":"2018-06-10","arxiv_id":"1806.03664","repositories_listed":0,"syntology":null},{"url":null,"slug":"pac-learning-in-the-presence-of-evasion","title":"PAC-learning in the presence of evasion adversaries","date":"2018-06-05","arxiv_id":"1806.01471","repositories_listed":0,"syntology":null},{"url":null,"slug":"almn-deep-embedding-learning-with-geometrical","title":"ALMN: Deep Embedding Learning with Geometrical Virtual Point Generating","date":"2018-06-04","arxiv_id":"1806.00974","repositories_listed":0,"syntology":null},{"url":null,"slug":"private-pac-learning-implies-finite","title":"Private PAC learning implies finite Littlestone dimension","date":"2018-06-04","arxiv_id":"1806.00949","repositories_listed":0,"syntology":null},{"url":null,"slug":"re-weighted-adversarial-adaptation-network","title":"Re-Weighted Adversarial Adaptation Network for Unsupervised Domain Adaptation","date":"2018-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"lstms-exploit-linguistic-attributes-of-data","title":"LSTMs Exploit Linguistic Attributes of Data","date":"2018-05-29","arxiv_id":"1805.11653","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-neural-network-trained-to-predict-future","title":"A neural network trained to predict future video frames mimics critical properties of biological neuronal responses and perception","date":"2018-05-28","arxiv_id":"1805.10734","repositories_listed":0,"syntology":null},{"url":null,"slug":"universality-of-deep-convolutional-neural","title":"Universality of Deep Convolutional Neural Networks","date":"2018-05-28","arxiv_id":"1805.10769","repositories_listed":0,"syntology":null},{"url":"/paper/dynamic-network-model-from-partial","slug":"dynamic-network-model-from-partial","title":"Dynamic Network Model from Partial Observations","date":"2018-05-27","arxiv_id":"1805.10616","repositories_listed":0,"syntology":null},{"url":null,"slug":"variational-inference-for-data-efficient","title":"Variational Inference for Data-Efficient Model Learning in POMDPs","date":"2018-05-23","arxiv_id":"1805.09281","repositories_listed":0,"syntology":null},{"url":null,"slug":"fully-understanding-the-hashing-trick","title":"Fully Understanding the Hashing Trick","date":"2018-05-22","arxiv_id":"1805.08539","repositories_listed":0,"syntology":null},{"url":null,"slug":"sample-compression-for-real-valued-learners","title":"Sample Compression for Real-Valued Learners","date":"2018-05-21","arxiv_id":"1805.08254","repositories_listed":0,"syntology":null},{"url":null,"slug":"universal-fluctuations-in-growth-dynamics-of","title":"Universal fluctuations in growth dynamics of economic systems","date":"2018-05-21","arxiv_id":"1712.02003","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-and-a-new-selection-criterion-for","title":"A survey and a new selection criterion for statistical home range estimation","date":"2018-04-13","arxiv_id":"1804.05129","repositories_listed":0,"syntology":null},{"url":null,"slug":"unspanned-stochastic-volatility-in-the-multi","title":"Unspanned Stochastic Volatility in the Multi-factor CIR Model","date":"2018-04-13","arxiv_id":"1705.02789","repositories_listed":0,"syntology":null},{"url":null,"slug":"evaluation-of-object-trackers-in-distorted","title":"Evaluation of Object Trackers in Distorted Surveillance Videos","date":"2018-04-04","arxiv_id":"1804.01624","repositories_listed":0,"syntology":null},{"url":null,"slug":"knowledge-based-recurrent-attentive-neural","title":"Feature Selective Small Object Detection via Knowledge-based Recurrent Attentive Neural Network","date":"2018-03-13","arxiv_id":"1803.05263","repositories_listed":0,"syntology":null},{"url":null,"slug":"disentangling-the-independently-controllable","title":"Disentangling the independently controllable factors of variation by interacting with the world","date":"2018-02-26","arxiv_id":"1802.09484","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-examples-that-fool-both-computer","title":"Adversarial Examples that Fool both Computer Vision and Time-Limited Humans","date":"2018-02-22","arxiv_id":"1802.08195","repositories_listed":0,"syntology":null}],"record_sha256":"cc978b3950d3d6e3b1a04e5bcd72b5935bcb447da324d0126c5180f93fa26095","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}