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

2585177751,033 · Jun 202019922001200920172026
48 results for algorithm design

The paper proposes a method to reliably select design algorithms for machine learning-guided design tasks.

problem Choosing the right design algorithm for machine learning-guided design tasks.
method Combining designs' predicted property values with held-out labeled data to reliably forecast characteristics of the label distributions produced by different design algorithms.
result The method is guaranteed to return design algorithms that yield successful label distributions.

Unified framework for combinatorial and rounding algorithms in experimental design.

problem Designing and analyzing combinatorial and rounding algorithms for experimental design problems.
method Local search framework for combinatorial algorithms and regret minimization framework for rounding algorithms.
result Unified approach to match and improve all known results in D/A/E-design and obtain new results in unknown settings.

Efficient deep learning computing requires algorithm and hardware co-design to enable specialization: we usually need to change the algorithm to reduce memory footprint and improve energy efficiency. However, the extra degree of freedom from the algorithm makes the design space much larger: it's not only about designin…

2019-04-24abs ↗pdf ↗

Study evaluates reinforcement learning algorithms for sequential experimental design.

problem Lack of generalization in reinforcement learning for experimental design.
method Investigated several reinforcement learning algorithms for sequential experimental design.
result Certain algorithms, using dropout or ensemble approaches, show attractive generalization properties.

FTRL algorithm with negative entropy regularizer achieves best-of-three-world results for linear bandits.

problem Designing an FTRL algorithm for linear bandits with optimal regret bounds.
method Follow-the-regularized-leader (FTRL) algorithm with negative entropy regularizer.
result Regret bounds achieve the same or nearly the same order as detect-switch type algorithm but with simpler design.

QCircuitBench provides a dataset for evaluating AI's ability to design quantum algorithms.

problem Lack of datasets for evaluating AI's capability in designing quantum algorithms.
method Developed a comprehensive benchmark dataset with 120,290 data points, including 25 algorithms and 3 task suites.
result LLMs exhibit consistent error patterns and fine-tuning does not always outperform few-shot learning.

PSO improves GG-optimal designs for up to 5 factors, reducing computation time.

problem Computing highly GG-optimal designs for response surface models is computationally expensive.
method Extended Particle Swarm Optimization (PSO) for optimal design problems.
result PSO generates improved GG-optimal designs for up to 5 factors with comparable computational cost.

Estimates funding impact from an algorithmic relief rule, finding little effect on hospital activities.

problem Evaluating the impact of algorithmic policy decisions.
method Developed a treatment-effect estimator using algorithmic decisions as instruments.
result Funding from an algorithmic relief rule had little effect on COVID-19-related hospital activities.

Multi-layer optical film has been found to afford important applications in optical communication, optical absorbers, optical filters, etc. Different algorithms of multi-layer optical film design has been developed, as simplex method, colony algorithm, genetic algorithm. These algorithms rapidly promote the design and …

2018-12-07abs ↗pdf ↗

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.

BoGA combines evolutionary search with Bayesian optimization for efficient protein design.

problem Designing novel proteins with specific characteristics is challenging due to sequence space complexity.
method BoGA integrates a genetic algorithm with Bayesian optimization to efficiently explore sequence space.
result BoGA accelerates discovery of high-confidence binders for diverse protein design objectives.

This paper optimizes portfolios using HRP and CLA algorithms on NIFTY 50 stocks.

problem Designing an optimal stock portfolio with accurate forecasting of future returns and risks.
method Uses hierarchical risk parity and critical line algorithms on NIFTY 50 stocks.
result Hierarchical risk parity algorithm outperformed the critical line algorithm on test data.

Do-AIQ framework evaluates AI algorithms' quality using DOE.

problem Quality evaluation of AI mislabel detection algorithms.
method Design-of-experiment approach with high-dimensional constraint space design and surrogate modeling.
result Established framework for evaluating AI algorithm quality robustly.

Study uses machine learning to optimize seismic design parameters.

problem Optimizing seismic design parameters for performance-based design.
method Implementing explainable machine learning models to map design variables and performance metrics, integrated into a genetic optimization algorithm.
result Highly accurate surrogate models (R2> 90%) across diverse building types and hazards, identifying optimal member properties.

Gradient GA uses gradient information to improve molecular design.

problem Random walk exploration limits genetic algorithms' quality and speed in molecular design.
method Gradient GA incorporates gradient information from the objective function into genetic algorithms, using a differentiable neural network and Discrete Langevin Proposal.
result Significantly improves convergence speed and solution quality over traditional genetic algorithms.

Paper proposes an unbiased optimization method for Bayesian experimental design.

problem Maximizing expected information gain in Bayesian experimental design.
method Randomized multilevel Monte Carlo (MLMC) method combined with stochastic gradient descent.
result An unbiased estimator for the gradient of expected information gain.

This paper analyzes OCBA algorithms' convergence rates for DEDS optimization.

problem Optimizing discrete-event dynamic systems with limited computing resources.
method Characterizes convergence rates of two OCBA algorithms under different performance measures.
result OCBA algorithms achieve optimal convergence rates under probability of correct selection and expected opportunity cost measures.

Automated HPO design using Bayesian optimization and benchmarking.

problem Designing effective hyperparameter optimization algorithms is manual and lacks systematic understanding.
method Formalized space of HPO candidates, Bayesian optimization for search, ablation analysis.
result Simple configurations can perform well in HPO, especially with right parameters.

This work improves algorithm design for structured Pfaffian settings.

problem Designing algorithms for specific application domains with theoretical guarantees.
method Data-driven algorithm design using hyperparameter tuning and learning guarantees.
result Introduced the Pfaffian GJ framework for providing learning guarantees for Pfaffian function classes.

NPOD algorithm improves efficiency in estimating pharmacokinetic parameters.

problem Efficiently estimating joint distribution of model parameters in population pharmacokinetics.
method Uses gradient approach to suggest new support points, reducing evaluation time.
result Achieves similar solutions to NPAG but with significantly fewer cycles and runtime.

A neural network and evolutionary algorithm framework designs nonlinear optical molecules.

problem Designing efficient nonlinear optical materials.
method Multi-stage Bayesian neural network (msBNN) and corrected Lewis-mode group contribution method (cLGC) combined with evolutionary algorithm (EA).
result Accurately and efficiently designs molecules with different optical properties using a small data set.

In this paper, we propose a new framework for designing fast parallel algorithms for fundamental statistical subset selection tasks that include feature selection and experimental design. Such tasks are known to be weakly submodular and are amenable to optimization via the standard greedy algorithm. Despite its desirab…

2019-03-06abs ↗pdf ↗

Optimizes pure exploration in linear bandits with a new algorithm.

problem Best-arm identification in linear stochastic bandits.
method Developed the first asymptotically optimal algorithm for fixed-confidence pure exploration in linear bandits.
result Avoids the pitfall of a simple but difficult instance and bypasses the need to solve an optimal design problem.

A fast algorithm for counting Markov equivalent DAGs and designing experiments.

problem Counting Markov equivalent DAGs and designing experiments efficiently.
method LazyIter algorithm for efficient iteration over MECs, utilizing intervention results.
result Significant reduction in time complexity for sparse graphs (O(n)).

Algorithm optimizes system design and control for better rewards.

problem Optimizing system design and control for maximum rewards.
method Deep reinforcement learning combining policy gradient and model-based optimization.
result DEPS algorithm outperforms state-of-the-art methods in various environments.

A new design methodology for neural networks that is guided by traditional algorithm design is presented. To prove our point, we present two heuristics and demonstrate an algorithmic technique for incorporating additional weights in their signal-flow graphs. We show that with training the performance of these networks …

2018-06-06abs ↗pdf ↗

This work introduces benchmarks for evaluating nanophotonic structures in design simulations.

problem Design and understanding of nanophotonic structures for various applications.
method Development of frameworks and benchmarks for evaluating nanophotonic structures in parametric design problems.
result Strategic use of evaluation fidelity in enhancing structure designs.

Paper introduces IO-NPF for efficient Bayesian experimental design.

problem Efficient Bayesian experimental design in non-exchangeable settings.
method Inside-Out Nested Particle Filter (IO-NPF) for non-Markovian state-space models.
result IO-NPF achieves O(T2)\mathcal{O}(T^2) computational complexity, improving efficiency.

Algorithm learns optimal dynamic mechanisms from data.

problem Designing optimal mechanisms for dynamic settings with unknown reward functions.
method Offline reinforcement learning with pessimism principle.
result Learned mechanisms are efficient, individually rational, and truthful.

In radar systems, unimodular (or constant-modulus) waveform design plays an important role in achieving better clutter/interference rejection, as well as a more accurate estimation of the target parameters. The design of such sequences has been studied widely in the last few decades, with most design algorithms requiri…

2019-12-17abs ↗pdf ↗

Algorithm design is a laborious process and often requires many iterations of ideation and validation. In this paper, we explore automating algorithm design and present a method to learn an optimization algorithm, which we believe to be the first method that can automatically discover a better algorithm. We approach th…

2016-06-06abs ↗pdf ↗

New algorithm recovers sparse signals robustly against Gaussian noise and adaptive adversaries.

problem Designing efficient estimators for sparse linear regression in the presence of two adversaries.
method Polynomial-time algorithms using sum-of-squares relaxations and weighted Huber loss minimization.
result Achieves error o(ε)o(\sqrt{\varepsilon}) for various distributions and adversaries.

The goal of data-driven algorithm design is to obtain high-performing algorithms for specific application domains using machine learning and data. Across many fields in AI, science, and engineering, practitioners will often fix a family of parameterized algorithms and then optimize those parameters to obtain good perfo…

2019-04-18abs ↗pdf ↗

New algorithm converts data into sub-gaussian designs efficiently.

problem Efficiently converting large datasets into sub-gaussian random designs for robust performance.
method Algorithmic Gaussianization through sketching and averaging, using LESS embeddings.
result Efficient data sketches nearly indistinguishable from sub-gaussian designs.

Paper develops an efficient algorithm for experiment design using synthetic controls.

problem Designing optimal experiments for treatment effect estimation.
method Solves a phase synchronization problem via a normalized generalized power method.
result First global optimality guarantee for experiment design with pre-treatment data.