Related papers: G-coupling functions
Bilevel optimization has been widely used in decision-making process. However, there still lacks an efficient algorithm to determine an optimal solution of a bilevel optimization problem, especially for a large-size problem. To bridge the…
Graph Generating Dependencies (GGDs) informally express constraints between two (possibly different) graph patterns which enforce relationships on both graph's data (via property value constraints) and its structure (via topological…
Combinatorial optimization can be described as the problem of finding a feasible subset that maximizes a objective function. The paper discusses combinatorial optimization problems, where for each dimension the set of feasible subsets is…
Convex functions have played a major role in the field of Mathematical inequalities. In this paper, we introduce a new concept related to convexity, which proves better estimates when the function is somehow more convex than another. In…
Multi-objective search (MOS) has become essential in robotics, as real-world robotic systems need to simultaneously balance multiple, often conflicting objectives. Recent works explore complex interactions between objectives, leading to…
It is shown how different globally coupled map systems can be analyzed under a common framework by focusing on the dynamics of their respective global coupling functions. We investigate how the functional form of the coupling determines the…
In the paper a new fitting function is suggested, which can essentially increase the existing instrumentation for fitting of asymmetric peaks with the only maximum.
I will present a way to implement graph algorithms which is different from traditional methods. This work was motivated by the belief that some ideas from software engineering should be applied to graph algorithms. Re-usability of software…
Variational Gaussian process (GP) approximations have become a standard tool in fast GP inference. This technique requires a user to select variational features to increase efficiency. So far the common choices in the literature are…
The accurate prediction of time-changing variances is an important task in the modeling of financial data. Standard econometric models are often limited as they assume rigid functional relationships for the variances. Moreover, function…
An efficient numerical algorithm for the computation of linking number is presented. The algorithm keep tracks or rounding error so that it can ensure the correctness of the results.
This paper studies the problem of learning the correlation structure of a set of intervention functions defined on the directed acyclic graph (DAG) of a causal model. This is useful when we are interested in jointly learning the causal…
We propose a method for optimizing mutual coupling functions to achieve fast and global synchronization between a pair of weakly coupled limit-cycle oscillators. Our method is based on phase reduction that provides a concise low-dimensional…
Complex computer codes are often too time expensive to be directly used to perform uncertainty, sensitivity, optimization and robustness analyses. A widely accepted method to circumvent this problem consists in replacing cpu-time expensive…
The problem of reconstructing functions from their asymptotic expansions in powers of a small variable is addressed by deriving a novel type of approximants. The derivation is based on the self-similar approximation theory, which presents…
The aim of this paper is to give the text of a recent introduction to nonlinear generalized functions exposed in my talk in the congress gf2011, which was asked by several participants. Three representative topics were presented: two…
Matching one set of objects to another is a ubiquitous task in machine learning and computer vision that often reduces to some form of the quadratic assignment problem (QAP). The QAP is known to be notoriously hard, both in theory and in…
Connected and automated vehicles (CAVs) provide the most intriguing opportunity for enabling users to monitor transportation network conditions and make better decisions for improving safety and transportation efficiency. In this paper, we…
Many product formulas are known classically for generalized hypergeometric functions over the complex numbers. In this paper, we establish some analogous formulas for generalized hypergeometric functions over finite fields.
This note gives a few rapidly convergent series representations of the sums of divisors functions. These series have various applications such as exact evaluations of some power series, computing estimates and proving the existence results…