Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

199399598797 · Jun 202019922001200920172026
48 results for population-based optimization

Operator calculus for population-based optimization provides a unified framework for analyzing convergence of various methods.

problem Convergence analysis of population-based optimization methods
method Introduce an operator calculus for describing composite mean-field algorithms as compositions of elementary operators acting on probability measures.
result Establish a modular Lyapunov principle for certifying exponential decay of state-space Lyapunov function and search errors.

Fiber simplifies RL and population-based methods for distributed training.

problem Challenges in RL and population-based methods, including frequent interaction with simulations and dynamic scaling.
method Introducing Fiber, a scalable distributed computing framework.
result Significantly expands accessibility of large-scale parallel computation.

Automates RL with sample-efficient hyperparameter optimization.

problem Challenges in applying deep RL due to hyperparameter sensitivity and inefficiency.
method Population-based AutoRL framework for meta-optimizing RL algorithms and architectures.
result Reduces the number of environment interactions needed for meta-optimization by up to an order of magnitude.

Aims to describe neural network training dynamics using two-time-scale models.

problem Lack of a general mathematical description of neural network training.
method Introduces a theoretical framework based on two-time-scale population dynamics.
result Derives selection-mutation equations and effective fitness for hyperparameters.

P3BO optimizes biological sequence design by combining multiple methods.

problem Variability in performance of black-box optimization methods for biological sequence design.
method Population-Based Black-Box Optimization (P3BO) that samples sequences from an ensemble of methods, weighting by past performance.
result P3BO outperforms individual methods, proposing higher quality and more diverse sequences.

Dynamic meta-learning improves multi-agent communication with natural language.

problem Static population-based approaches struggle with adapting to human partners using natural language.
method Dynamic population-based meta-learning approach.
result Agents outperform all prior work in communicating with seen partners and humans.

High-throughput 3D control training system achieves 100,000 FPS.

problem Lack of efficient, single-machine reinforcement learning systems.
method Sample Factory combines asynchronous sampling and off-policy correction.
result Achieves 100,000 FPS on 3D control problems without sacrificing sample efficiency.

We examine the effects of instantiating Lewis signaling games within a population of speaker and listener agents with the aim of producing a set of general and robust representations of unstructured pixel data. Preliminary experiments suggest that the set of representations associated with languages generated within a …

2019-11-06abs ↗pdf ↗

FIRE PBT improves neural network training by focusing on long-term performance.

problem Greedy decision mechanisms in PBT lead to poor long-term performance.
method FIRE PBT uses a fitness metric to encourage long-term performance over short-term improvements.
result FIRE PBT outperforms PBT on ImageNet and matches hand-tuned learning rates.

Learning to optimize has emerged as a powerful framework for various optimization and machine learning tasks. Current such "meta-optimizers" often learn in the space of continuous optimization algorithms that are point-based and uncertainty-unaware. To overcome the limitations, we propose a meta-optimizer that learns i…

2019-11-09abs ↗pdf ↗

This paper is concerned with a recently developed paradigm for population-based optimization, termed particle filter optimization (PFO). This paradigm is attractive in terms of coherence in theory and easiness in mathematical analysis and interpretation. Current PFO algorithms only work for single-objective optimizatio…

2018-08-28abs ↗pdf ↗

While we would like agents that can coordinate with humans, current algorithms such as self-play and population-based training create agents that can coordinate with themselves. Agents that assume their partner to be optimal or similar to them can converge to coordination protocols that fail to understand and be unders…

2019-10-13abs ↗pdf ↗

This paper develops a geometric framework for SHM using feature bundles and gauge theories.

problem Defining feature spaces in population-based SHM.
method Introduces feature bundles as sections of vector bundles over structure spaces, and uses Graph Neural Networks for feature assignment.
result Develops a mathematical framework for SHM that incorporates feature spaces and gauge theories.

Enhances inverse design optimization with machine learning and reduced fidelity simulations.

problem Limited compute resources in inverse design optimization.
method Synergy of multi-fidelity simulations, machine learning, and search space reduction.
result Significant computational resource savings and improved optimization performance.

Improved disentanglement of data factors using recursive training.

problem Current unsupervised disentanglement methods are inconsistent and fail to achieve levels of disentanglement seen in supervised approaches.
method Introduced PBT for VAEs, used UDR for heuristic scoring, and developed recursive rPU-VAE approach.
result Recursive training leads to robust disentanglement of data factors across multiple datasets.

Researchers developed a generic model to account for structural variability in SHM.

problem Variability in natural frequency due to operational and environmental conditions limits SHM technologies.
method An overlapping mixture of Gaussian processes (OMGP) was used to generate a generic representation of normal condition.
result The OMGP model provided a generic representation (form) to characterise the normal condition of structures.

The performance of policy gradient methods is sensitive to hyperparameter settings that must be tuned for any new application. Widely used grid search methods for tuning hyperparameters are sample inefficient and computationally expensive. More advanced methods like Population Based Training that learn optimal schedule…

2019-02-18abs ↗pdf ↗

Hybridizes CEM and gradient descent for efficient model-predictive control.

problem Efficiently planning optimal action sequences in high-dimensional spaces.
method Interleaves Cross-Entropy Method (CEM) and gradient descent steps.
result Faster convergence and avoidance of local optima compared to CEM.

The paper proposes a technique to speed up evolutionary algorithms by using lower-cost approximations of the objective function.

problem Evolutionary algorithms require many evaluations to solve computationally expensive black-box optimization problems.
method The paper introduces a technique to choose an appropriate approximate function cost during the execution of the optimization algorithm.
result The proposed approach can reach the same objective value in less than half the time in certain cases.

Exploration is a key problem in reinforcement learning, since agents can only learn from data they acquire in the environment. With that in mind, maintaining a population of agents is an attractive method, as it allows data be collected with a diverse set of behaviors. This behavioral diversity is often boosted via mul…

2020-02-03abs ↗pdf ↗

Objectives: Most cancer data sources lack information on metastatic recurrence. Electronic medical records (EMRs) and population-based cancer registries contain complementary information on cancer treatment and outcomes, yet are rarely used synergistically. To enable detection of metastatic breast cancer (MBC), we appl…

2019-01-17abs ↗pdf ↗

Deep Reinforcement Learning (DRL) algorithms have been successfully applied to a range of challenging control tasks. However, these methods typically suffer from three core difficulties: temporal credit assignment with sparse rewards, lack of effective exploration, and brittle convergence properties that are extremely …

2018-05-21abs ↗pdf ↗

Recent developments in high throughput profiling of individual neurons have spurred data driven exploration of the idea that there exist natural groupings of neurons referred to as cell types. The promise of this idea is that the immense complexity of brain circuits can be reduced, and effectively studied by means of i…

2019-11-06abs ↗pdf ↗

Developed a cost and revenue model for HEMS to estimate breakeven transport volumes under different reimbursement and labor cost assumptions.

problem Estimating breakeven transport volumes for HEMS under varying reimbursement and labor cost assumptions.
method Developed a two-part model: cost framework and actuarial revenue model using healthcare encounter data and payer reimbursement rates.
result Estimated breakeven transport volumes under different reimbursement and labor cost assumptions.

Epidemiology simulations have become a fundamental tool in the fight against the epidemics of various infectious diseases like AIDS and malaria. However, the complicated and stochastic nature of these simulators can mean their output is difficult to interpret, which reduces their usefulness to policymakers. In this pap…

2019-05-29abs ↗pdf ↗

SkewPNN uses probabilistic neural networks with skew-normal kernels to improve classification of imbalanced data.

problem Imbalanced data distribution leading to biased predictions for minority classes.
method Probabilistic neural networks with skew-normal kernel function and Bat optimization algorithm for hyperparameter tuning.
result SkewPNN and BA-SkewPNN outperform other methods in both balanced and imbalanced datasets.

Artificial neural network (ANN) provides superior accuracy for nonlinear alternating current (AC) state estimation (SE) in smart grid over traditional methods. However, research has discovered that ANN could be easily fooled by adversarial examples. In this paper, we initiate a new study of adversarial false data injec…

2019-06-26abs ↗pdf ↗