{"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/computational-efficiency/papers/46","list_of":"/task/computational-efficiency","task":"Computational Efficiency","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":46,"pages_in_order":49,"rows_per_page":100,"rows":[4501,4600],"of":4891,"counts":{"archive_papers_tagged":4891,"with_a_code_link":1644,"where_syntology_ran_a_sample":369,"not_listed_spam_title":0,"listed":4891,"listed_where_code_ran":369,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":307,"every_run_a_failure_of_syntologys_instrument":62,"listed_with_a_run_with_no_instrument_failure":307,"listed_every_run_a_failure_of_syntologys_instrument":62,"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/computational-efficiency","prev":"/task/computational-efficiency/papers/45","next":"/task/computational-efficiency/papers/47","papers":[{"url":null,"slug":"accelerated-sparse-recovery-under-structured","title":"Accelerated Sparse Recovery Under Structured Measurements","date":"2019-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"encoding-categorical-variables-with-conjugate","title":"Encoding Categorical Variables with Conjugate Bayesian Models for WeWork Lead Scoring Engine","date":"2019-04-30","arxiv_id":"1904.13001","repositories_listed":0,"syntology":null},{"url":null,"slug":"convtimenet-a-pre-trained-deep-convolutional","title":"ConvTimeNet: A Pre-trained Deep Convolutional Neural Network for Time Series Classification","date":"2019-04-29","arxiv_id":"1904.12546","repositories_listed":0,"syntology":null},{"url":null,"slug":"s2-lbi-stochastic-split-linearized-bregman","title":"$S^{2}$-LBI: Stochastic Split Linearized Bregman Iterations for Parsimonious Deep Learning","date":"2019-04-24","arxiv_id":"1904.10873","repositories_listed":0,"syntology":null},{"url":null,"slug":"190409233","title":"Deep Cytometry: Deep learning with Real-time Inference in Cell Sorting and Flow Cytometry","date":"2019-04-09","arxiv_id":"1904.09233","repositories_listed":0,"syntology":null},{"url":null,"slug":"gait-recognition-via-disentangled","title":"Gait Recognition via Disentangled Representation Learning","date":"2019-04-09","arxiv_id":"1904.04925","repositories_listed":0,"syntology":null},{"url":null,"slug":"safeaccess-towards-a-dialogue-enabled-access","title":"Person Identification with Visual Summary for a Safe Access to a Smart Home","date":"2019-04-02","arxiv_id":"1904.01178","repositories_listed":0,"syntology":null},{"url":null,"slug":"spherical-u-net-on-cortical-surfaces-methods","title":"Spherical U-Net on Cortical Surfaces: Methods and Applications","date":"2019-04-01","arxiv_id":"1904.00906","repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-neural-architecture-search","title":"Understanding Neural Architecture Search Techniques","date":"2019-03-31","arxiv_id":"1904.00438","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-convolution-free-lbp-hog-descriptor-for","title":"An LBP-HOG Descriptor Based on Matrix Projection For Mammogram Classification","date":"2019-03-30","arxiv_id":"1904.00187","repositories_listed":0,"syntology":null},{"url":null,"slug":"medical-time-series-classification-with","title":"Medical Time Series Classification with Hierarchical Attention-based Temporal Convolutional Networks: A Case Study of Myotonic Dystrophy Diagnosis","date":"2019-03-28","arxiv_id":"1903.11748","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-search-based-weighted-model","title":"Efficient Search-Based Weighted Model Integration","date":"2019-03-13","arxiv_id":"1903.05334","repositories_listed":0,"syntology":null},{"url":null,"slug":"tensor-grid-decomposition-with-application-to","title":"Low-rank Tensor Grid for Image Completion","date":"2019-03-12","arxiv_id":"1903.04735","repositories_listed":0,"syntology":null},{"url":null,"slug":"toward-fast-and-accurate-neural-chinese-word","title":"Toward Fast and Accurate Neural Chinese Word Segmentation with Multi-Criteria Learning","date":"2019-03-11","arxiv_id":"1903.04190","repositories_listed":0,"syntology":null},{"url":null,"slug":"composite-event-recognition-for-maritime","title":"Composite Event Recognition for Maritime Monitoring","date":"2019-03-07","arxiv_id":"1903.03078","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-densenet-based-approach-for-multi-frame-in","title":"A DenseNet Based Approach for Multi-Frame In-Loop Filter in HEVC","date":"2019-03-05","arxiv_id":"1903.01648","repositories_listed":0,"syntology":null},{"url":null,"slug":"lipschitz-adaptivity-with-multiple-learning","title":"Lipschitz Adaptivity with Multiple Learning Rates in Online Learning","date":"2019-02-27","arxiv_id":"1902.10797","repositories_listed":0,"syntology":null},{"url":null,"slug":"nonlinear-approximation-via-compositions","title":"Nonlinear Approximation via Compositions","date":"2019-02-26","arxiv_id":"1902.10170","repositories_listed":0,"syntology":null},{"url":null,"slug":"ssa-cnn-semantic-self-attention-cnn-for","title":"SSA-CNN: Semantic Self-Attention CNN for Pedestrian Detection","date":"2019-02-25","arxiv_id":"1902.09080","repositories_listed":0,"syntology":null},{"url":null,"slug":"appearance-based-gesture-recognition-in-the","title":"Appearance-based Gesture recognition in the compressed domain","date":"2019-02-19","arxiv_id":"1903.00100","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-task-aware-architecture-inference","title":"Fast Task-Aware Architecture Inference","date":"2019-02-15","arxiv_id":"1902.05781","repositories_listed":0,"syntology":null},{"url":null,"slug":"box-level-segmentation-supervised-deep-neural","title":"Box-level Segmentation Supervised Deep Neural Networks for Accurate and Real-time Multispectral Pedestrian Detection","date":"2019-02-14","arxiv_id":"1902.05291","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimization-problems-with-low-swap-tactical","title":"Optimization problems with low SWaP tactical Computing","date":"2019-02-13","arxiv_id":"1902.05070","repositories_listed":0,"syntology":null},{"url":null,"slug":"structured-bayesian-compression-for-deep","title":"Structured Bayesian Compression for Deep models in mobile enabled devices for connected healthcare","date":"2019-02-13","arxiv_id":"1902.05429","repositories_listed":0,"syntology":null},{"url":null,"slug":"restocnet-residual-stochastic-binary","title":"ReStoCNet: Residual Stochastic Binary Convolutional Spiking Neural Network for Memory-Efficient Neuromorphic Computing","date":"2019-02-11","arxiv_id":"1902.04161","repositories_listed":0,"syntology":null},{"url":null,"slug":"neurall-towards-a-unified-model-for-visual","title":"NeurAll: Towards a Unified Visual Perception Model for Automated Driving","date":"2019-02-10","arxiv_id":"1902.03589","repositories_listed":0,"syntology":null},{"url":null,"slug":"physics-and-derivatives-effective-potential","title":"Physics and Derivatives: Effective-Potential Path-Integral Approximations of Arrow-Debreu Densities","date":"2019-02-10","arxiv_id":"1902.03610","repositories_listed":0,"syntology":null},{"url":null,"slug":"bidirectional-inference-networks-a-class-of","title":"Bidirectional Inference Networks: A Class of Deep Bayesian Networks for Health Profiling","date":"2019-02-06","arxiv_id":"1902.02037","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-least-squares-low-rank-kernel-machines","title":"Sparse Least Squares Low Rank Kernel Machines","date":"2019-01-29","arxiv_id":"1901.10098","repositories_listed":0,"syntology":null},{"url":null,"slug":"degraf-flow-extending-degraf-features-for","title":"DeGraF-Flow: Extending DeGraF Features for accurate and efficient sparse-to-dense optical flow estimation","date":"2019-01-28","arxiv_id":"1901.09971","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-surrogate-modeling-methods-for","title":"Efficient surrogate modeling methods for large-scale Earth system models based on machine learning techniques","date":"2019-01-16","arxiv_id":"1901.05125","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-and-adaptive-planning-under-model","title":"Robust and Adaptive Planning under Model Uncertainty","date":"2019-01-09","arxiv_id":"1901.02577","repositories_listed":0,"syntology":null},{"url":null,"slug":"reproducibility-evaluation-of-slant-whole","title":"Reproducibility Evaluation of SLANT Whole Brain Segmentation Across Clinical Magnetic Resonance Imaging Protocols","date":"2019-01-07","arxiv_id":"1901.02040","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-approximation-algorithms-for","title":"Stochastic Approximation Algorithms for Principal Component Analysis","date":"2019-01-07","arxiv_id":"1901.01798","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-convolutional-neural-network","title":"Efficient Convolutional Neural Network Training with Direct Feedback Alignment","date":"2019-01-06","arxiv_id":"1901.01986","repositories_listed":0,"syntology":null},{"url":null,"slug":"artificial-neural-networks-condensation-a","title":"Artificial neural networks condensation: A strategy to facilitate adaption of machine learning in medical settings by reducing computational burden","date":"2018-12-23","arxiv_id":"1812.09659","repositories_listed":0,"syntology":null},{"url":null,"slug":"accurate-hand-keypoint-localization-on-mobile","title":"Accurate Hand Keypoint Localization on Mobile Devices","date":"2018-12-19","arxiv_id":"1812.08028","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimized-feedforward-neural-network-training","title":"Optimized Feedforward Neural Network Training for Efficient Brillouin Frequency Shift Retrieval in Fiber","date":"2018-12-19","arxiv_id":"1812.07737","repositories_listed":0,"syntology":null},{"url":null,"slug":"imbalanced-biomedical-data-classification","title":"Imbalanced biomedical data classification using self-adaptive multilayer ELM combined with dynamic GAN","date":"2018-12-17","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"shortcut-matrix-product-states-and-its","title":"Shortcut Matrix Product States and its applications","date":"2018-12-13","arxiv_id":"1812.05248","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-item-interaction-embeddings-for-user","title":"Learning Item-Interaction Embeddings for User Recommendations","date":"2018-12-11","arxiv_id":"1812.04407","repositories_listed":0,"syntology":null},{"url":null,"slug":"non-intrusive-load-monitoring-with-fully","title":"Non-Intrusive Load Monitoring with Fully Convolutional Networks","date":"2018-12-10","arxiv_id":"1812.03915","repositories_listed":0,"syntology":null},{"url":null,"slug":"demystifying-excessively-volatile-human","title":"Demystifying excessively volatile human learning: A Bayesian persistent prior and a neural approximation","date":"2018-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-stochastic-gradient-hard","title":"Efficient Stochastic Gradient Hard Thresholding","date":"2018-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"pac-bayes-tree-weighted-subtrees-with","title":"PAC-Bayes Tree: weighted subtrees with guarantees","date":"2018-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"regret-bounds-for-online-portfolio-selection","title":"Regret Bounds for Online Portfolio Selection with a Cardinality Constraint","date":"2018-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-signal-recovery-with-one-bit","title":"Deep Signal Recovery with One-Bit Quantization","date":"2018-11-30","arxiv_id":"1812.00797","repositories_listed":0,"syntology":null},{"url":null,"slug":"compact-and-efficient-encodings-for-planning","title":"Compact and Efficient Encodings for Planning in Factored State and Action Spaces with Learned Binarized Neural Network Transition Models","date":"2018-11-26","arxiv_id":"1811.10433","repositories_listed":0,"syntology":null},{"url":null,"slug":"machine-learning-enables-long-time-scale","title":"Machine learning enables long time scale molecular photodynamics simulations","date":"2018-11-22","arxiv_id":"1811.09112","repositories_listed":0,"syntology":null},{"url":null,"slug":"private-selection-from-private-candidates","title":"Private Selection from Private Candidates","date":"2018-11-19","arxiv_id":"1811.07971","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-and-scalable-multi-task-regression","title":"Efficient and Scalable Multi-task Regression on Massive Number of Tasks","date":"2018-11-14","arxiv_id":"1811.05695","repositories_listed":0,"syntology":null},{"url":null,"slug":"meta-learning-for-multi-objective","title":"Meta-Learning for Multi-objective Reinforcement Learning","date":"2018-11-08","arxiv_id":"1811.03376","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-defense-by-learning-to-attack","title":"Learning to Defend by Learning to Attack","date":"2018-11-03","arxiv_id":"1811.01213","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-online-hyperparameter-optimization","title":"Efficient Online Hyperparameter Optimization for Kernel Ridge Regression with Applications to Traffic Time Series Prediction","date":"2018-11-01","arxiv_id":"1811.00620","repositories_listed":0,"syntology":null},{"url":null,"slug":"dont-forget-there-is-more-than-forgetting-new","title":"Don't forget, there is more than forgetting: new metrics for Continual Learning","date":"2018-10-31","arxiv_id":"1810.13166","repositories_listed":0,"syntology":null},{"url":null,"slug":"batch-normalization-sampling","title":"Batch Normalization Sampling","date":"2018-10-25","arxiv_id":"1810.10962","repositories_listed":0,"syntology":null},{"url":null,"slug":"ms-baco-a-new-model-selection-algorithm-using","title":"MS-BACO: A new Model Selection algorithm using Binary Ant Colony Optimization for neural complexity and error reduction","date":"2018-10-21","arxiv_id":"1810.08944","repositories_listed":0,"syntology":null},{"url":null,"slug":"training-structured-efficient-convolutional","title":"Training Structured Efficient Convolutional Layers","date":"2018-10-20","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"dn-resnet-efficient-deep-residual-network-for","title":"DN-ResNet: Efficient Deep Residual Network for Image Denoising","date":"2018-10-16","arxiv_id":"1810.06766","repositories_listed":0,"syntology":null},{"url":null,"slug":"combinatorial-attacks-on-binarized-neural","title":"Combinatorial Attacks on Binarized Neural Networks","date":"2018-10-08","arxiv_id":"1810.03538","repositories_listed":0,"syntology":null},{"url":null,"slug":"rough-set-based-lattice-structure-for","title":"Rough set based lattice structure for knowledge representation in medical expert systems: low back pain management case study","date":"2018-10-02","arxiv_id":"1810.01560","repositories_listed":0,"syntology":null},{"url":null,"slug":"fairness-aware-classification-criterion","title":"Fairness-aware Classification: Criterion, Convexity, and Bounds","date":"2018-09-13","arxiv_id":"1809.04737","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-patchworks-an-approach-to-case-based","title":"Bayesian Patchworks: An Approach to Case-Based Reasoning","date":"2018-09-10","arxiv_id":"1809.03541","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-deeper-look-at-3d-shape-classifiers","title":"A Deeper Look at 3D Shape Classifiers","date":"2018-09-07","arxiv_id":"1809.02560","repositories_listed":0,"syntology":null},{"url":null,"slug":"retgk-graph-kernels-based-on-return","title":"RetGK: Graph Kernels based on Return Probabilities of Random Walks","date":"2018-09-07","arxiv_id":"1809.02670","repositories_listed":0,"syntology":null},{"url":null,"slug":"modelling-point-spread-function-in","title":"Modelling Point Spread Function in Fluorescence Microscopy with a Sparse Combination of Gaussian Mixture: Trade-off between Accuracy and Efficiency","date":"2018-09-05","arxiv_id":"1809.01579","repositories_listed":0,"syntology":null},{"url":null,"slug":"end-to-end-view-synthesis-for-light-field","title":"End-to-end View Synthesis for Light Field Imaging with Pseudo 4DCNN","date":"2018-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"training-binary-weight-networks-via-semi","title":"Training Binary Weight Networks via Semi-Binary Decomposition","date":"2018-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-exploit-invariances-in-clinical","title":"Learning to Exploit Invariances in Clinical Time-Series Data using Sequence Transformer Networks","date":"2018-08-21","arxiv_id":"1808.06725","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-fast-and-robust-matching-framework-for","title":"Fast and Robust Matching for Multimodal Remote Sensing Image Registration","date":"2018-08-19","arxiv_id":"1808.06194","repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervisedsemi-supervised-deep-learning-for","title":"Unsupervised/Semi-supervised Deep Learning for Low-dose CT Enhancement","date":"2018-08-08","arxiv_id":"1808.02603","repositories_listed":0,"syntology":null},{"url":null,"slug":"rethinking-numerical-representations-for-deep","title":"Rethinking Numerical Representations for Deep Neural Networks","date":"2018-08-07","arxiv_id":"1808.02513","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-sample-complexity-of-up-to-varepsilon","title":"The Sample Complexity of Up-to-$\\varepsilon$ Multi-Dimensional Revenue Maximization","date":"2018-08-07","arxiv_id":"1808.02458","repositories_listed":0,"syntology":null},{"url":null,"slug":"teacher-guided-architecture-search","title":"Teacher Guided Architecture Search","date":"2018-08-04","arxiv_id":"1808.01405","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-power-of-complementary-regularizers-image","title":"The Power of Complementary Regularizers: Image Recovery via Transform Learning and Low-Rank Modeling","date":"2018-08-03","arxiv_id":"1808.01316","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-impact-of-imbalanced-training-data-on","title":"The impact of imbalanced training data on machine learning for author name disambiguation","date":"2018-07-30","arxiv_id":"1808.00525","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-machine-learning-framework-for-data-driven","title":"A machine learning framework for data driven acceleration of computations of differential equations","date":"2018-07-25","arxiv_id":"1807.09519","repositories_listed":0,"syntology":null},{"url":null,"slug":"signal-alignment-for-humanoid-skeletons-via","title":"Signal Alignment for Humanoid Skeletons via the Globally Optimal Reparameterization Algorithm","date":"2018-07-18","arxiv_id":"1807.07432","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-globally-optimal-reparameterization","title":"The Globally Optimal Reparameterization Algorithm: an Alternative to Fast Dynamic Time Warping for Action Recognition in Video Sequences","date":"2018-07-15","arxiv_id":"1807.05485","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-unified-framework-for-sparse-relaxed","title":"A Unified Framework for Sparse Relaxed Regularized Regression: SR3","date":"2018-07-14","arxiv_id":"1807.05411","repositories_listed":0,"syntology":null},{"url":null,"slug":"performance-of-image-registration-tools-on","title":"Performance of Image Registration Tools on High-Resolution 3D Brain Images","date":"2018-07-13","arxiv_id":"1807.04917","repositories_listed":0,"syntology":null},{"url":null,"slug":"dual-optimization-for-convex-constrained","title":"Dual optimization for convex constrained objectives without the gradient-Lipschitz assumption","date":"2018-07-10","arxiv_id":"1807.03545","repositories_listed":0,"syntology":null},{"url":null,"slug":"model-free-optimization-using-eagle-perching","title":"Model-Free Optimization Using Eagle Perching Optimizer","date":"2018-07-08","arxiv_id":"1807.02754","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-single-shot-text-detector-with-scale","title":"A Single Shot Text Detector with Scale-adaptive Anchors","date":"2018-07-05","arxiv_id":"1807.01884","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-layer-wise-precision-in-deep","title":"Stochastic Layer-Wise Precision in Deep Neural Networks","date":"2018-07-03","arxiv_id":"1807.00942","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-efficient-approach-to-encoding-context-for","title":"An Efficient Approach to Encoding Context for Spoken Language Understanding","date":"2018-07-01","arxiv_id":"1807.00267","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-and-consistent-adversarial","title":"Efficient and Consistent Adversarial Bipartite Matching","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-pca-with-ell_2-and-ell_1","title":"Stochastic PCA with $\\ell_2$ and $\\ell_1$ Regularization","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"an-online-prediction-algorithm-for","title":"An Online Prediction Algorithm for Reinforcement Learning with Linear Function Approximation using Cross Entropy Method","date":"2018-06-15","arxiv_id":"1806.06720","repositories_listed":0,"syntology":null},{"url":null,"slug":"supervised-fuzzy-partitioning","title":"Supervised Fuzzy Partitioning","date":"2018-06-15","arxiv_id":"1806.06124","repositories_listed":0,"syntology":null},{"url":"/paper/attentive-cross-modal-paratope-prediction","slug":"attentive-cross-modal-paratope-prediction","title":"Attentive cross-modal paratope prediction","date":"2018-06-12","arxiv_id":"1806.04398","repositories_listed":0,"syntology":null},{"url":null,"slug":"composite-marginal-likelihood-methods-for","title":"Composite Marginal Likelihood Methods for Random Utility Models","date":"2018-06-04","arxiv_id":"1806.01426","repositories_listed":0,"syntology":null},{"url":null,"slug":"hydranets-specialized-dynamic-architectures","title":"HydraNets: Specialized Dynamic Architectures for Efficient Inference","date":"2018-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"core-conflictual-relationship-text-mining-to","title":"Core Conflictual Relationship: Text Mining to Discover What and When","date":"2018-05-28","arxiv_id":"1805.11140","repositories_listed":0,"syntology":null},{"url":null,"slug":"ergodic-measure-preserving-flows","title":"Ergodic Inference: Accelerate Convergence by Optimisation","date":"2018-05-25","arxiv_id":"1805.10377","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantizing-convolutional-neural-networks-for","title":"Quantizing Convolutional Neural Networks for Low-Power High-Throughput Inference Engines","date":"2018-05-21","arxiv_id":"1805.07941","repositories_listed":0,"syntology":null},{"url":null,"slug":"exp-concavity-of-proper-composite-losses","title":"Exp-Concavity of Proper Composite Losses","date":"2018-05-20","arxiv_id":"1805.07737","repositories_listed":0,"syntology":null},{"url":null,"slug":"automated-process-planning-for-hybrid","title":"Automated Process Planning for Hybrid Manufacturing","date":"2018-05-18","arxiv_id":"1805.07035","repositories_listed":0,"syntology":null},{"url":null,"slug":"dyna-a-method-of-momentum-for-stochastic","title":"Dyna: A Method of Momentum for Stochastic Optimization","date":"2018-05-13","arxiv_id":"1805.04933","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-open-information-extraction","title":"Neural Open Information Extraction","date":"2018-05-11","arxiv_id":"1805.04270","repositories_listed":0,"syntology":null}],"record_sha256":"1c3cb2f6616597372848bf31ea34a9fafa33a468668f109d5f4e75e0db28f710","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}