[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

Pourchot et al., 2018 - Google Patents

Importance mixing: Improving sample reuse in evolutionary policy search methods

Pourchot et al., 2018

View PDF
Document ID
13182626427715260819
Author
Pourchot A
Perrin N
Sigaud O
Publication year
Publication venue
arXiv preprint arXiv:1808.05832

External Links

Snippet

Deep neuroevolution, that is evolutionary policy search methods based on deep neural networks, have recently emerged as a competitor to deep reinforcement learning algorithms due to their better parallelization capabilities. However, these methods still suffer from a far …
Continue reading at arxiv.org (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N99/00—Subject matter not provided for in other groups of this subclass
    • G06N99/005—Learning machines, i.e. computer in which a programme is changed according to experience gained by the machine itself during a complete run
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computer systems based on biological models
    • G06N3/02—Computer systems based on biological models using neural network models
    • G06N3/08—Learning methods
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computer systems based on biological models
    • G06N3/12—Computer systems based on biological models using genetic models
    • G06N3/126—Genetic algorithms, i.e. information processing using digital simulations of the genetic system
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management, e.g. organising, planning, scheduling or allocating time, human or machine resources; Enterprise planning; Organisational models
    • G06Q10/063—Operations research or analysis
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/18—Complex mathematical operations for evaluating statistical data, e.g. average values, frequency distributions, probability functions, regression analysis
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computer systems utilising knowledge based models
    • G06N5/04—Inference methods or devices
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation, e.g. linear programming, "travelling salesman problem" or "cutting stock problem"
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06K—RECOGNITION OF DATA; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K9/00—Methods or arrangements for reading or recognising printed or written characters or for recognising patterns, e.g. fingerprints
    • G06K9/62—Methods or arrangements for recognition using electronic means
    • G06K9/6217—Design or setup of recognition systems and techniques; Extraction of features in feature space; Clustering techniques; Blind source separation
    • G06K9/6232—Extracting features by transforming the feature space, e.g. multidimensional scaling; Mappings, e.g. subspace methods
    • G06K9/6247—Extracting features by transforming the feature space, e.g. multidimensional scaling; Mappings, e.g. subspace methods based on an approximation criterion, e.g. principal component analysis
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N7/00—Computer systems based on specific mathematical models
    • G06N7/005—Probabilistic networks

Similar Documents

Publication Publication Date Title
Mei et al. Atomnas: Fine-grained end-to-end neural architecture search
Nouiehed et al. Solving a class of non-convex min-max games using iterative first order methods
Liu et al. Stein variational gradient descent: A general purpose bayesian inference algorithm
Pourchot et al. Importance mixing: Improving sample reuse in evolutionary policy search methods
Shutin et al. Fast variational sparse Bayesian learning with automatic relevance determination for superimposed signals
Wainwright et al. High-Dimensional Graphical Model Selection Using $\ell_1 $-Regularized Logistic Regression
Du et al. Probabilistic streaming tensor decomposition
Heess et al. Learning to pass expectation propagation messages
Masti et al. Learning binary warm starts for multiparametric mixed-integer quadratic programming
Niinimäki et al. Annealed Importance Sampling for Structure Learning in Bayesian Networks.
Agrawal et al. Normalized Mutual Information-based equilibrium optimizer with chaotic maps for wrapper-filter feature selection
Liu et al. Efficient reinforced feature selection via early stopping traverse strategy
Rosca et al. Discretization drift in two-player games
Liu et al. Minimax estimation of large precision matrices with bandable Cholesky factor
Sansone LSB: Local self-balancing MCMC in discrete spaces
Tolpin et al. Output-sensitive adaptive metropolis-hastings for probabilistic programs
El-Melegy Ransac algorithm with sequential probability ratio test for robust training of feed-forward neural networks
Ding et al. Efficient model-based collaborative filtering with fast adaptive PCA
Chakraborty et al. On an optimization problem in robust statistics
Lian et al. Revisit batch normalization: New understanding from an optimization view and a refinement via composition optimization
Bompaire et al. Dual optimization for convex constrained objectives without the gradient-lipschitz assumption
Guzman et al. Adaptive model predictive control by learning classifiers
WO2021226709A1 (en) Neural architecture search with imitation learning
Wu et al. Discretization-free knowledge gradient methods for bayesian optimization
Sage et al. A residual-based approach for robust random forest regression