{"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/efficient-exploration/papers/5","list_of":"/task/efficient-exploration","task":"Efficient Exploration","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":5,"pages_in_order":6,"rows_per_page":100,"rows":[401,500],"of":514,"counts":{"archive_papers_tagged":514,"with_a_code_link":189,"where_syntology_ran_a_sample":57,"not_listed_spam_title":0,"listed":514,"listed_where_code_ran":57,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":48,"every_run_a_failure_of_syntologys_instrument":9,"listed_with_a_run_with_no_instrument_failure":48,"listed_every_run_a_failure_of_syntologys_instrument":9,"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/efficient-exploration","prev":"/task/efficient-exploration/papers/4","next":"/task/efficient-exploration/papers/6","papers":[{"url":null,"slug":"intrinsically-guided-exploration-in-meta","title":"Intrinsically Guided Exploration in Meta Reinforcement Learning","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"mqes-max-q-entropy-search-for-efficient","title":"MQES: Max-Q Entropy Search for Efficient Exploration in Continuous Reinforcement Learning","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"online-limited-memory-neural-linear-bandits","title":"Online Limited Memory Neural-Linear Bandits","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"optimistic-exploration-with-backward","title":"Optimistic Exploration with Backward Bootstrapped Bonus for Deep Reinforcement Learning","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"robotic-grasping-of-fully-occluded-objects","title":"Robotic Grasping of Fully-Occluded Objects using RF Perception","date":"2020-12-31","arxiv_id":"2012.15436","repositories_listed":0,"syntology":null},{"url":null,"slug":"curiosity-in-exploring-chemical-space","title":"Curiosity in exploring chemical space: Intrinsic rewards for deep molecular reinforcement learning","date":"2020-12-17","arxiv_id":"2012.11293","repositories_listed":0,"syntology":null},{"url":null,"slug":"sar-image-despeckling-based-on-convolutional","title":"SAR Image Despeckling Based on Convolutional Denoising Autoencoder","date":"2020-11-30","arxiv_id":"2011.14627","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-exploration-of-reward-functions-in-1","title":"Efficient Exploration of Reward Functions in Inverse Reinforcement Learning via Bayesian Optimization","date":"2020-11-17","arxiv_id":"2011.08541","repositories_listed":0,"syntology":null},{"url":null,"slug":"hierarchical-reinforcement-learning-for-3","title":"Hierarchical reinforcement learning for efficient exploration and transfer","date":"2020-11-12","arxiv_id":"2011.06335","repositories_listed":0,"syntology":null},{"url":null,"slug":"variational-dynamic-for-self-supervised","title":"Variational Dynamic for Self-Supervised Exploration in Deep Reinforcement Learning","date":"2020-10-17","arxiv_id":"2010.08755","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-robotic-object-search-via-hiem","title":"Efficient Robotic Object Search via HIEM: Hierarchical Policy Learning with Intrinsic-Extrinsic Modeling","date":"2020-10-16","arxiv_id":"2010.08596","repositories_listed":0,"syntology":null},{"url":null,"slug":"real-time-uncertainty-decomposition-for-1","title":"Deep Learning based Uncertainty Decomposition for Real-time Control","date":"2020-10-06","arxiv_id":"2010.02613","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-decentralized-and-collaborative","title":"Efficient, Decentralized, and Collaborative Multi-Robot Exploration using Optimal Transport Theory","date":"2020-09-29","arxiv_id":"2009.14434","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-exploration-for-model-based","title":"Efficient Exploration for Model-based Reinforcement Learning with Continuous States and Actions","date":"2020-09-28","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"semi-self-supervised-exploration-via","title":"SEMI: Self-supervised Exploration via Multisensory Incongruity","date":"2020-09-26","arxiv_id":"2009.12494","repositories_listed":0,"syntology":null},{"url":null,"slug":"plotthread-creating-expressive-storyline","title":"PlotThread: Creating Expressive Storyline Visualizations using Reinforcement Learning","date":"2020-09-01","arxiv_id":"2009.00249","repositories_listed":0,"syntology":null},{"url":null,"slug":"auto-map-a-dqn-framework-for-exploring","title":"Auto-MAP: A DQN Framework for Exploring Distributed Execution Plans for DNN Workloads","date":"2020-07-08","arxiv_id":"2007.04069","repositories_listed":0,"syntology":null},{"url":null,"slug":"end-effect-exploration-drive-for-effective","title":"End-Effect Exploration Drive for Effective Motor Learning","date":"2020-06-29","arxiv_id":"2006.15960","repositories_listed":0,"syntology":null},{"url":null,"slug":"task-agnostic-exploration-in-reinforcement","title":"Task-agnostic Exploration in Reinforcement Learning","date":"2020-06-16","arxiv_id":"2006.09497","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-proprioception-to-long-horizon-planning","title":"From proprioception to long-horizon planning in novel environments: A hierarchical RL model","date":"2020-06-11","arxiv_id":"2006.06620","repositories_listed":0,"syntology":null},{"url":null,"slug":"pbcs-efficient-exploration-and-exploitation","title":"PBCS : Efficient Exploration and Exploitation Using a Synergy between Reinforcement Learning and Motion Planning","date":"2020-04-24","arxiv_id":"2004.11667","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-optimisation-of-large-scale-photonic","title":"Bayesian optimisation of large-scale photonic reservoir computers","date":"2020-04-06","arxiv_id":"2004.02535","repositories_listed":0,"syntology":null},{"url":null,"slug":"weakly-supervised-reinforcement-learning-for","title":"Weakly-Supervised Reinforcement Learning for Controllable Behavior","date":"2020-04-06","arxiv_id":"2004.02860","repositories_listed":0,"syntology":null},{"url":null,"slug":"active-model-estimation-in-markov-decision","title":"Active Model Estimation in Markov Decision Processes","date":"2020-03-06","arxiv_id":"2003.03297","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-exploration-in-constrained","title":"Efficient Exploration in Constrained Environments with Goal-Oriented Reference Path","date":"2020-03-03","arxiv_id":"2003.01641","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-exploration-of-zero-sum-stochastic","title":"Efficient exploration of zero-sum stochastic games","date":"2020-02-24","arxiv_id":"2002.10524","repositories_listed":0,"syntology":null},{"url":null,"slug":"particle-filter-based-monocular-human","title":"Particle Filter Based Monocular Human Tracking with a 3D Cardbox Model and a Novel Deterministic Resampling Strategy","date":"2020-02-21","arxiv_id":"2002.09554","repositories_listed":0,"syntology":null},{"url":null,"slug":"split-bolfi-for-for-misspecification-robust","title":"Misspecification-robust likelihood-free inference in high dimensions","date":"2020-02-21","arxiv_id":"2002.09377","repositories_listed":0,"syntology":null},{"url":null,"slug":"minimax-confidence-interval-for-off-policy","title":"Minimax Value Interval for Off-Policy Evaluation and Policy Optimization","date":"2020-02-06","arxiv_id":"2002.02081","repositories_listed":0,"syntology":null},{"url":null,"slug":"recruitment-imitation-mechanism-for","title":"Recruitment-imitation Mechanism for Evolutionary Reinforcement Learning","date":"2019-12-13","arxiv_id":"1912.06310","repositories_listed":0,"syntology":null},{"url":null,"slug":"provably-efficient-exploration-in-policy","title":"Provably Efficient Exploration in Policy Optimization","date":"2019-12-12","arxiv_id":"1912.05830","repositories_listed":0,"syntology":null},{"url":null,"slug":"explicit-planning-for-efficient-exploration","title":"Explicit Planning for Efficient Exploration in Reinforcement Learning","date":"2019-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"comprehensive-decision-strategy-space","title":"Comprehensive decision-strategy space exploration for efficient territorial planning strategies","date":"2019-11-26","arxiv_id":"1911.11460","repositories_listed":0,"syntology":null},{"url":null,"slug":"scaling-active-inference","title":"Scaling active inference","date":"2019-11-24","arxiv_id":"1911.10601","repositories_listed":0,"syntology":null},{"url":null,"slug":"implicit-generative-modeling-for-efficient-1","title":"Implicit Generative Modeling for Efficient Exploration","date":"2019-11-19","arxiv_id":"1911.08017","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-exploration-through-intrinsic","title":"Efficient Exploration through Intrinsic Motivation Learning for Unsupervised Subgoal Discovery in Model-Free Hierarchical Reinforcement Learning","date":"2019-11-18","arxiv_id":"1911.10164","repositories_listed":0,"syntology":null},{"url":null,"slug":"mame-model-agnostic-meta-exploration","title":"MAME : Model-Agnostic Meta-Exploration","date":"2019-11-11","arxiv_id":"1911.04024","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-path-policy-optimization","title":"Multi-Path Policy Optimization","date":"2019-11-11","arxiv_id":"1911.04207","repositories_listed":0,"syntology":null},{"url":null,"slug":"structured-exploration-in-the-finite-horizon","title":"Structured exploration in the finite horizon linear quadratic dual control problem","date":"2019-10-31","arxiv_id":"1910.14492","repositories_listed":0,"syntology":null},{"url":null,"slug":"vase-variational-assorted-surprise","title":"VASE: Variational Assorted Surprise Exploration for Reinforcement Learning","date":"2019-10-31","arxiv_id":"1910.14351","repositories_listed":0,"syntology":null},{"url":null,"slug":"better-exploration-with-optimistic-actor","title":"Better Exploration with Optimistic Actor-Critic","date":"2019-10-28","arxiv_id":"1910.12807","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-transferable-graph-exploration","title":"Learning Transferable Graph Exploration","date":"2019-10-28","arxiv_id":"1910.12980","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-exploration-by-novelty-pursuit-with","title":"Deep exploration by novelty-pursuit with maximum state entropy","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"neuralucb-contextual-bandits-with-neural","title":"NeuralUCB: Contextual Bandits with Neural Network-Based Exploration","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"regulatory-focus-promotion-and-prevention","title":"Regulatory Focus: Promotion and Prevention Inclinations in Policy Search","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-index-selection-with-structured","title":"Learning Index Selection with Structured Action Spaces","date":"2019-09-16","arxiv_id":"1909.07440","repositories_listed":0,"syntology":null},{"url":null,"slug":"biased-estimates-of-advantages-over-path","title":"Biased Estimates of Advantages over Path Ensembles","date":"2019-09-15","arxiv_id":"1909.06851","repositories_listed":0,"syntology":null},{"url":null,"slug":"sqrtn-regret-for-learning-in-markov-decision","title":"$\\sqrt{n}$-Regret for Learning in Markov Decision Processes with Function Approximation and Low Bellman Rank","date":"2019-09-05","arxiv_id":"1909.02506","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-a-state-of-the-art-heuristic-for","title":"Improving a State-of-the-Art Heuristic for the Minimum Latency Problem with Data Mining","date":"2019-08-28","arxiv_id":"1908.10705","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-explore-in-motion-and-interaction","title":"Learning to Explore in Motion and Interaction Tasks","date":"2019-08-10","arxiv_id":"1908.03731","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-exploration-with-self-imitation","title":"Memory Based Trajectory-conditioned Policies for Learning from Sparse Rewards","date":"2019-07-24","arxiv_id":"1907.10247","repositories_listed":0,"syntology":null},{"url":null,"slug":"directed-exploration-for-reinforcement","title":"Directed Exploration for Reinforcement Learning","date":"2019-06-18","arxiv_id":"1906.07805","repositories_listed":0,"syntology":null},{"url":null,"slug":"worst-case-regret-bounds-for-exploration-via","title":"Worst-Case Regret Bounds for Exploration via Randomized Value Functions","date":"2019-06-07","arxiv_id":"1906.02870","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustered-reinforcement-learning","title":"Clustered Reinforcement Learning","date":"2019-06-06","arxiv_id":"1906.02457","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-efficient-and-effective-exploration","title":"Learning Efficient and Effective Exploration Policies with Counterfactual Meta Policy","date":"2019-05-28","arxiv_id":"1905.11583","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-exploration-policies-for-model","title":"Learning Exploration Policies for Model-Agnostic Meta-Reinforcement Learning","date":"2019-05-16","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"distributional-reinforcement-learning-for","title":"Distributional Reinforcement Learning for Efficient Exploration","date":"2019-05-13","arxiv_id":"1905.06125","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimizing-routerless-network-on-chip-designs","title":"Optimizing Routerless Network-on-Chip Designs: An Innovative Learning-Based Framework","date":"2019-05-11","arxiv_id":"1905.04423","repositories_listed":0,"syntology":null},{"url":null,"slug":"beyond-games-bringing-exploration-to-robots","title":"Beyond Games: Bringing Exploration to Robots in Real-world","date":"2019-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"explicit-recall-for-efficient-exploration","title":"Explicit Recall for Efficient Exploration","date":"2019-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-neural-linear-bandits-overcoming","title":"Deep Neural Linear Bandits: Overcoming Catastrophic Forgetting through Likelihood Matching","date":"2019-01-24","arxiv_id":"1901.08612","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploration-bonus-for-regret-minimization-in","title":"Exploration Bonus for Regret Minimization in Undiscounted Discrete and Continuous Markov Decision Processes","date":"2018-12-11","arxiv_id":"1812.04363","repositories_listed":0,"syntology":null},{"url":null,"slug":"context-dependent-upper-confidence-bounds-for","title":"Context-Dependent Upper-Confidence Bounds for Directed Exploration","date":"2018-11-15","arxiv_id":"1811.06629","repositories_listed":0,"syntology":null},{"url":null,"slug":"incentivizing-exploration-with-unbiased","title":"Incentivizing Exploration with Selective Data Disclosure","date":"2018-11-14","arxiv_id":"1811.06026","repositories_listed":0,"syntology":null},{"url":null,"slug":"deepgonet-multi-label-prediction-of-go","title":"DEEPGONET: Multi-label Prediction of GO Annotation for Protein from Sequence Using Cascaded Convolutional and Recurrent Network","date":"2018-10-31","arxiv_id":"1811.00053","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-agent-fully-decentralized-value","title":"Multi-Agent Fully Decentralized Value Function Learning with Linear Convergence Rates","date":"2018-10-17","arxiv_id":"1810.07792","repositories_listed":0,"syntology":null},{"url":null,"slug":"thompson-sampling-for-cascading-bandits","title":"Thompson Sampling Algorithms for Cascading Bandits","date":"2018-10-02","arxiv_id":"1810.01187","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploration-by-uncertainty-in-reward-space","title":"Exploration by Uncertainty in Reward Space","date":"2018-09-27","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"nsga-net-a-multi-objective-genetic-algorithm-1","title":"NSGA-Net: A Multi-Objective Genetic Algorithm for Neural Architecture Search","date":"2018-09-27","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"directed-exploration-in-pac-model-free","title":"Directed Exploration in PAC Model-Free Reinforcement Learning","date":"2018-08-31","arxiv_id":"1808.10552","repositories_listed":0,"syntology":null},{"url":null,"slug":"discovering-context-specific-causal","title":"Discovering Context Specific Causal Relationships","date":"2018-08-20","arxiv_id":"1808.06316","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimization-by-pairwise-linkage-detection","title":"Optimization by Pairwise Linkage Detection, Incremental Linkage Set, and Restricted / Back Mixing: DSMGA-II","date":"2018-07-31","arxiv_id":"1807.11669","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-interrupt-a-hierarchical-deep","title":"Learning to Interrupt: A Hierarchical Deep Reinforcement Learning Framework for Efficient Exploration","date":"2018-07-30","arxiv_id":"1807.11150","repositories_listed":0,"syntology":null},{"url":null,"slug":"newsleak-20-multilingual-information","title":"New/s/leak 2.0 - Multilingual Information Extraction and Visualization for Investigative Journalism","date":"2018-07-13","arxiv_id":"1807.05151","repositories_listed":0,"syntology":null},{"url":null,"slug":"goal-oriented-trajectories-for-efficient","title":"Goal-oriented Trajectories for Efficient Exploration","date":"2018-07-05","arxiv_id":"1807.02078","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-web-scale-system-for-scientific-knowledge","title":"A Web-scale system for scientific knowledge exploration","date":"2018-05-30","arxiv_id":"1805.12216","repositories_listed":0,"syntology":null},{"url":null,"slug":"when-simple-exploration-is-sample-efficient","title":"When Simple Exploration is Sample Efficient: Identifying Sufficient Conditions for Random Exploration to Yield PAC RL Algorithms","date":"2018-05-23","arxiv_id":"1805.09045","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-exploration-of-gradient-space-for","title":"Efficient Exploration of Gradient Space for Online Learning to Rank","date":"2018-05-18","arxiv_id":"1805.07317","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploration-by-distributional-reinforcement","title":"Exploration by Distributional Reinforcement Learning","date":"2018-05-04","arxiv_id":"1805.01907","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-human-mixed-strategy-approach-to-deep","title":"A Human Mixed Strategy Approach to Deep Reinforcement Learning","date":"2018-04-05","arxiv_id":"1804.01874","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-mcmc-sampling-with-non-gaussian-and","title":"Dimension-Robust MCMC in Bayesian Inverse Problems","date":"2018-03-09","arxiv_id":"1803.03344","repositories_listed":0,"syntology":null},{"url":null,"slug":"diversity-driven-exploration-strategy-for","title":"Diversity-Driven Exploration Strategy for Deep Reinforcement Learning","date":"2018-02-13","arxiv_id":"1802.04564","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-eigenoption-critic-framework","title":"The Eigenoption-Critic Framework","date":"2017-12-11","arxiv_id":"1712.04065","repositories_listed":0,"syntology":null},{"url":null,"slug":"reinforced-dynamics-for-enhanced-sampling-in","title":"Reinforced dynamics for enhanced sampling in large atomic and molecular systems","date":"2017-12-10","arxiv_id":"1712.03461","repositories_listed":0,"syntology":null},{"url":null,"slug":"uncertainty-estimates-for-efficient-neural","title":"Uncertainty Estimates for Efficient Neural Network-based Dialogue Policy Optimisation","date":"2017-11-30","arxiv_id":"1711.11486","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-exploration-with-double-uncertain","title":"Efficient exploration with Double Uncertain Value Networks","date":"2017-11-29","arxiv_id":"1711.10789","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-compression-inspired-framework-for-macro","title":"A Compression-Inspired Framework for Macro Discovery","date":"2017-11-24","arxiv_id":"1711.09048","repositories_listed":0,"syntology":null},{"url":null,"slug":"bbq-networks-efficient-exploration-in-deep","title":"BBQ-Networks: Efficient Exploration in Deep Reinforcement Learning for Task-Oriented Dialogue Systems","date":"2017-11-15","arxiv_id":"1711.05715","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-density-networks-and-uncertainty-in","title":"Deep density networks and uncertainty in recommender systems","date":"2017-11-07","arxiv_id":"1711.02487","repositories_listed":0,"syntology":null},{"url":null,"slug":"vector-quantization-using-the-improved","title":"Vector Quantization using the Improved Differential Evolution Algorithm for Image Compression","date":"2017-10-15","arxiv_id":"1710.05311","repositories_listed":0,"syntology":null},{"url":null,"slug":"feature-engineering-for-predictive-modeling","title":"Feature Engineering for Predictive Modeling using Reinforcement Learning","date":"2017-09-21","arxiv_id":"1709.07150","repositories_listed":0,"syntology":null},{"url":null,"slug":"fractional-langevin-monte-carlo-exploring","title":"Fractional Langevin Monte Carlo: Exploring Levy Driven Stochastic Differential Equations for MCMC","date":"2017-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"hashing-over-predicted-future-frames-for","title":"Hashing over Predicted Future Frames for Informed Exploration of Deep Reinforcement Learning","date":"2017-07-03","arxiv_id":"1707.00524","repositories_listed":0,"syntology":null},{"url":null,"slug":"life-inet-a-structured-network-based","title":"Life-iNet: A Structured Network-Based Knowledge Exploration and Analytics System for Life Sciences","date":"2017-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"protein-design-by-multiobjective-optimization","title":"Protein design by multiobjective optimization: evolutionary and non-evolutionary approaches","date":"2017-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"fractional-langevin-monte-carlo-exploring-1","title":"Fractional Langevin Monte Carlo: Exploring Lévy Driven Stochastic Differential Equations for Markov Chain Monte Carlo","date":"2017-06-12","arxiv_id":"1706.03649","repositories_listed":0,"syntology":null},{"url":null,"slug":"k-means-clustering-using-tabu-search-with","title":"K-Means Clustering using Tabu Search with Quantized Means","date":"2017-03-24","arxiv_id":"1703.08440","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-exploration-via-randomized-value","title":"Deep Exploration via Randomized Value Functions","date":"2017-03-22","arxiv_id":"1703.07608","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-pose-and-cell-segmentation-using","title":"Efficient Pose and Cell Segmentation using Column Generation","date":"2016-12-01","arxiv_id":"1612.00437","repositories_listed":0,"syntology":null},{"url":null,"slug":"contextual-decision-processes-with-low","title":"Contextual Decision Processes with Low Bellman Rank are PAC-Learnable","date":"2016-10-29","arxiv_id":"1610.09512","repositories_listed":0,"syntology":null}],"record_sha256":"3884b1c08317608c17629db22db5f9ab3f9600f8d9ee922e025eada1d60adfaf","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}