arXiv research

Efficient adjustment sets found for cost-minimized causal estimations.

The economic life of an asset is the optimum length of its usefulness, which is the moment that the asset's expenses are minimum. In this paper, the economic life of physical assets, such as industry machine and equipment, can be interpreted as the moment that the minimum is reached by its equivalent property cost func…

We consider the minimum cost intervention design problem: Given the essential graph of a causal graph and a cost to intervene on a variable, identify the set of interventions with minimum total cost that can learn any causal graph with the given essential graph. We first show that this problem is NP-hard. We then prove…

The paper constructs upper bounds for cost minimization in shallow neural networks.

This paper provides formulas for minimum cost super-hedging in a multi-asset binomial market.

A new scheme reduces global search cost by a square root factor.

Stochastic shortest path (SSP) is a well-known problem in planning and control, in which an agent has to reach a goal state in minimum total expected cost. In the learning formulation of the problem, the agent is unaware of the environment dynamics (i.e., the transition function) and has to repeatedly play for a given …

Improved portfolio optimization method yields better risk-adjusted returns.

In predictive maintenance, model performance is usually assessed by means of precision, recall, and F1-score. However, employing the model with best performance, e.g. highest F1-score, does not necessarily result in minimum maintenance cost, but can instead lead to additional expenses. Thus, we propose to perform model…

We introduce and analyze a parallel sequential Monte Carlo methodology for the numerical solution of optimization problems that involve the minimization of a cost function that consists of the sum of many individual components. The proposed scheme is a stochastic zeroth order optimization algorithm which demands only t…

While progress has been made in understanding the robustness of machine learning classifiers to test-time adversaries (evasion attacks), fundamental questions remain unresolved. In this paper, we use optimal transport to characterize the minimum possible loss in an adversarial classification scenario. In this setting, …

Regulations impose idiosyncratic capital and funding costs for holding derivatives. Capital requirements are costly because derivatives desks are risky businesses; funding is costly in part because regulations increase the minimum funding tenor. Idiosyncratic costs mean no single measure makes derivatives martingales f…

Optimal student loan repayment strategies vary based on loan size.

Paper studies fundamental limits of communication in distributed learning.

Paper proposes quantum methods for optimizing machine learning functions.

New method improves MAP inference for CGMs on path graphs, avoiding approximation and maintaining integrality.

The paper extends cost-efficiency analysis to incomplete markets.

Efficient algorithms learn causal graphs with minimal interventions.

The paper introduces explainable $k$-means with axis-parallel hyperplanes for $d$-dimensional data.

New algorithms for planning with adversarial changes in costs.

General Motors or a local business, which one is better to be stimulated in post-crisis recessions, where government stimulation is meant to overcome recessions? Due to the budget constraints, it is quite relevant to ask how one can increase the chance of economic recovery. One of the key elements to answer this questi…

Traditionally, practitioners initialize the {\tt k-means} algorithm with centers chosen uniformly at random. Randomized initialization with uneven weights ({\tt k-means++}) has recently been used to improve the performance over this strategy in cost and run-time. We consider the k-means problem with semi-supervised inf…

Paper tackles best arm identification with cost consideration.

We consider the problem of learning a causal graph over a set of variables with interventions. We study the cost-optimal causal graph learning problem: For a given skeleton (undirected version of the causal graph), design the set of interventions with minimum total cost, that can uniquely identify any causal graph with…

We consider a budget-constrained bandit problem where each arm pull incurs a random cost, and yields a random reward in return. The objective is to maximize the total expected reward under a budget constraint on the total cost. The model is general in the sense that it allows correlated and potentially heavy-tailed cos…

A new pruning method reduces neural network computation without retraining.

Learning rates in stochastic neural network training are currently determined a priori to training, using expensive manual or automated iterative tuning. This study proposes gradient-only line searches to resolve the learning rate for neural network training algorithms. Stochastic sub-sampling during training decreases…

A new procedure for learning cost-sensitive SVM(CS-SVM) classifiers is proposed. The SVM hinge loss is extended to the cost sensitive setting, and the CS-SVM is derived as the minimizer of the associated risk. The extension of the hinge loss draws on recent connections between risk minimization and probability elicitat…

A new model forecasts optimal portfolio weights from high-frequency data.

MCAL reduces labeling costs by 6x for auto-labeling data sets.

SCORE technique reduces BO's high-dimensional search costs.

In reinforcement learning episodes, the rewards and punishments are often non-deterministic, and there are invariably stochastic elements governing the underlying situation. Such stochastic elements are often numerous and cannot be known in advance, and they have a tendency to obscure the underlying rewards and punishm…

The paper optimizes regret using covariance between costs and decisions.

In this paper we investigate the relationship between Funding Value Adjustment (FVA) and Net Stable Funding Ratio (NSFR). FVA is defined in a consistent way with NSFR such that the new framework of FVA monitors the costs due to keeping NSFR at an acceptable level, as well. In addition, the problem of choosing the optim…

Study schedules jobs with unknown holding costs to minimize expected cumulative cost.

Many important optimization problems, such as the minimum spanning tree and minimum-cost flow, can be solved optimally by a greedy method. In this work, we study a learning variant of these problems, where the model of the problem is unknown and has to be learned by interacting repeatedly with the environment in the ba…

Gradient descent with geometrically adapted metrics drives $\mathcal{L}^2$ cost to global minimum at uniform rate.

We regard the real symplectic group $Sp(2n,\mathbb{R})$ as a constraint submanifold of the $2n\times 2n$ real matrices $\mathcal{M}_{2n}(\mathbb{R})$ endowed with the Euclidean (Frobenius) metric, respectively as a submanifold of the general linear group $Gl(2n,\mathbb{R})$ endowed with the (left) invariant metric. For…

COF algorithm minimizes cost in multi-armed bandits with known costs and reward constraints.

Improved OOD detection across various shifts using multi-encoder fusion of RDMs.

Comparing with traditional learning criteria, such as mean square error (MSE), the minimum error entropy (MEE) criterion is superior in nonlinear and non-Gaussian signal processing and machine learning. The argument of the logarithm in Renyis entropy estimator, called information potential (IP), is a popular MEE cost i…

Neural networks are a powerful class of nonlinear functions that can be trained end-to-end on various applications. While the over-parametrization nature in many neural networks renders the ability to fit complex functions and the strong representation power to handle challenging tasks, it also leads to highly correlat…

This paper presents a novel method to compute the exact Kantorovich-Wasserstein distance between a pair of $d$-dimensional histograms having $n$ bins each. We prove that this problem is equivalent to an uncapacitated minimum cost flow problem on a $(d+1)$-partite graph with $(d+1)n$ nodes and $dn^{\frac{d+1}{d}}$ arcs,…

The theory of multilayer networks is in its early stages, and its development provides vital methods for understanding complex systems. Multilayer networks, in their multiplex form, have been introduced within the last three years to analysing the structure of financial systems, and existing studies have modelled and e…

New method speeds up change-point detection in data sequences.

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

Robustifies Markowitz portfolios to reduce transaction costs and improve performance.

Recently, hybrid metaheuristics have become a trend in operations research. A successful example combines the Greedy Randomized Adaptive Search Procedures (GRASP) and data mining techniques, where frequent patterns found in high-quality solutions can lead to an efficient exploration of the search space, along with a si…