English
Related papers

Related papers: Statistical optimization of expensive multi-respon…

200 papers

Variable division and optimization (D\&O) is a frequently utilized algorithm design paradigm in Evolutionary Algorithms (EAs). A D\&O EA divides a variable into partial variables and then optimize them respectively. A complicated problem is…

Neural and Evolutionary Computing · Computer Science 2021-01-22 Yi Chen , Aimin Zhou

Real-life engineering optimization problems need Multiobjective Optimization (MOO) tools. These problems are highly nonlinear. As the process of Multiple Criteria Decision-Making (MCDM) is much expanded most MOO problems in different…

Software Engineering · Computer Science 2010-04-20 A. Mosavi

Option pricing, a fundamental problem in finance, often requires solving non-linear partial differential equations (PDEs). When dealing with multi-asset options, such as rainbow options, these PDEs become high-dimensional, leading to…

Computational Finance · Quantitative Finance 2023-11-14 Rawin Assabumrungrat , Kentaro Minami , Masanori Hirano

Under a nonlinear regression model with univariate response an algorithm for the generation of sequential adaptive designs is studied. At each stage, the current design is augmented by adding $p$ design points where $p$ is the dimension of…

Statistics Theory · Mathematics 2023-07-06 Fritjof Freise , Norbert Gaffke , Rainer Schwabe

This paper proposes a novel model-based approach to combine the quantitative dependability (safety, reliability, availability, maintainability and IT security) analysis and trade-off analysis. The proposed approach is called DPN…

Software Engineering · Computer Science 2020-05-13 Zhensheng Guo , Marc Zeller

In biomedical studies, researchers are often interested in assessing the association between one or more ordinal explanatory variables and an outcome variable, at the same time adjusting for covariates of any type. The outcome variable may…

Methodology · Statistics 2023-04-17 Kaspar Rufibach

Many sequential decision problems can be formulated as Markov Decision Processes (MDPs) where the optimal value function (or cost-to-go function) can be shown to satisfy a monotone structure in some or all of its dimensions. When the state…

Optimization and Control · Mathematics 2015-09-03 Daniel R. Jiang , Warren B. Powell

This paper discusses the critical decision process of extracting or selecting the features in a supervised learning context. It is often confusing to find a suitable method to reduce dimensionality. There are pros and cons to deciding…

Machine Learning · Computer Science 2022-06-22 Jean-Sébastien Dessureault , Daniel Massicotte

Software design patterns are standard solutions to common problems in software design and architecture. Knowing that a particular module implements a design pattern is a shortcut to design comprehension. Manually detecting design patterns…

Software Engineering · Computer Science 2021-12-03 Najam Nazar , Aldeida Aleti , Yaokun Zheng

Direct Preference Optimization (DPO) is a simple and efficient framework that has attracted substantial attention. However, it often struggles to meet its primary objectives -- increasing the generation probability of chosen responses while…

Artificial Intelligence · Computer Science 2025-06-17 Jay Hyeon Cho , JunHyeok Oh , Myunsoo Kim , Byung-Jun Lee

Differential equations (DEs) are commonly used to describe dynamic systems evolving in one (ordinary differential equations or ODEs) or in more than one dimensions (partial differential equations or PDEs). In real data applications the…

Methodology · Statistics 2013-11-25 Gianluca Frasso , Jonathan Jaeger , Philippe Lambert

Consider a Dirichlet process mixture model (DPM) with random precision parameter $\alpha$, inducing $K_n$ clusters over $n$ observations through its latent random partition. Our goal is to specify the prior distribution…

Methodology · Statistics 2025-06-03 Carlo Vicentini , Ian Hyla Jermyn

Many large MDPs can be represented compactly using a dynamic Bayesian network. Although the structure of the value function does not retain the structure of the process, recent work has shown that value functions in factored MDPs can often…

Artificial Intelligence · Computer Science 2013-01-18 Daphne Koller , Ron Parr

Deep Probabilistic Programming (DPP) allows powerful models based on recursive computation to be learned using efficient deep-learning optimization techniques. Additionally, DPP offers a unified perspective, where inference and learning…

Machine Learning · Computer Science 2022-03-31 Jonathan Warrell , Mark Gerstein

This paper presents a randomized algorithm for computing the near-optimal low-rank dynamic mode decomposition (DMD). Randomized algorithms are emerging techniques to compute low-rank matrix approximations at a fraction of the cost of…

Numerical Analysis · Mathematics 2019-11-28 N. Benjamin Erichson , Lionel Mathelin , Steven L. Brunton , J. Nathan Kutz

Dependent Dirichlet processes (DDP) have been widely applied to model data from distributions over collections of measures which are correlated in some way. On the other hand, in recent years, increasing research efforts in machine learning…

Machine Learning · Computer Science 2021-06-17 Xiaoli Li

Differentially-private histograms have emerged as a key tool for location privacy. While past mechanisms have included theoretical & experimental analysis, it has recently been observed that much of the existing literature does not fully…

Databases · Computer Science 2017-02-21 Maryam Fanaeepour , Benjamin I. P. Rubinstein

Every organism in an environment, whether biological, robotic or virtual, must be able to predict certain aspects of its environment in order to survive or perform whatever task is intended. It needs a model that is capable of estimating…

Machine Learning · Computer Science 2013-11-12 Stefan Richthofer , Laurenz Wiskott

Partially-observable Markov decision processes (POMDPs) with discounted-sum payoff are a standard framework to model a wide range of problems related to decision making under uncertainty. Traditionally, the goal has been to obtain policies…

Artificial Intelligence · Computer Science 2018-05-01 Krishnendu Chatterjee , Adrián Elgyütt , Petr Novotný , Owen Rouillé

We present an algorithm that releases a pure differentially private (under the replacement neighboring relation) sparse histogram for $n$ participants over a domain of size $d \gg n$. Our method achieves the optimal $\ell_\infty$-estimation…

Data Structures and Algorithms · Computer Science 2025-12-25 Florian Kerschbaum , Steven Lee , Hao Wu
‹ Prev 1 8 9 10 Next ›