arXiv research

Efficient adjustment sets found for cost-minimized causal estimations.

Many applications generate data with an intrinsic network structure such as time series data, image data or social network data. The network Lasso (nLasso) has been proposed recently as a method for joint clustering and optimization of machine learning models for networked data. The nLasso extends the Lasso from sparse…

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

New algorithm tests model calibration in nearly-linear time.

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,…

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…

Framework learns linear programs from optimal decisions.

In this work, we present a method to compute the Kantorovich-Wasserstein distance of order one between a pair of two-dimensional histograms. Recent works in Computer Vision and Machine Learning have shown the benefits of measuring Wasserstein distances of order one between histograms with $n$ bins, by solving a classic…

We study the question of fair clustering under the {\em disparate impact} doctrine, where each protected class must have approximately equal representation in every cluster. We formulate the fair clustering problem under both the $k$-center and the $k$-median objectives, and show that even with two protected classes th…

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

Embedding representation learning via neural networks is at the core foundation of modern similarity based search. While much effort has been put in developing algorithms for learning binary hamming code representations for search efficiency, this still requires a linear scan of the entire dataset per each query and tr…

New guarantees for adaptive combinatorial maximization with various objectives.

Efficient algorithms learn causal graphs with minimal interventions.

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…

Paper uses Gaussian processes to solve AC-OPF with renewable uncertainty.

We study the fixed-support Wasserstein barycenter problem (FS-WBP), which consists in computing the Wasserstein barycenter of $m$ discrete probability measures supported on a finite metric space of size $n$. We show first that the constraint matrix arising from the standard linear programming (LP) representation of the…

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…

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…

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…

We study the complexity of approximating the multimarginal optimal transport (MOT) distance, a generalization of the classical optimal transport distance, considered here between $m$ discrete probability distributions supported each on $n$ support points. First, we show that the standard linear programming (LP) represe…

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

We study the robustness of active learning (AL) algorithms against prior misspecification: whether an algorithm achieves similar performance using a perturbed prior as compared to using the true prior. In both the average and worst cases of the maximum coverage setting, we prove that all $α$-approximate algorithms are …

The paper explores arbitrage opportunities in derivative markets under specific conditions.

Study shows sample complexity for learning optimal policies in SSP with generative model.

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…

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 …

Optimal subset selection for hypothesis testing with penalties.

For some or all of the data instances a number of independent-world clustering issues suffer from incomplete data characterization due to losing or absent attributes. Typical clustering approaches cannot be applied directly to such data unless pre-processing by techniques like imputation or marginalization. We have ove…

New algorithm for low-rank optimal transport with improved interpretability and efficiency.

This paper optimizes caching and model multiplexing for large model inference.

A new probabilistic framework for optimal transport using collective graphical models.

Study on costs of manipulating AMM-based price oracles.

Improved exploration algorithm for unknown MDPs with reduced sample complexity.

This paper proposes a new method to learn combinatorial patterns for airline crew pairing optimization.

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

Adaptive sequential decision making is one of the central challenges in machine learning and artificial intelligence. In such problems, the goal is to design an interactive policy that plans for an action to take, from a finite set of $n$ actions, given some partial observations. It has been shown that in many applicat…

Optimal penalties for RECs balance environmental and revenue impacts.

Optimizes exploration for nonlinear systems to learn controllers efficiently.

New flows introduced for symplectic geometry.

The paper examines Ricci flows with closed and smooth tangent flows, proving uniqueness and characterizing ancient flows.

Study shows hard sample complexity for learning optimal policies in stochastic shortest path problems.

Proves uniqueness of geometric flow in various Riemannian manifolds.

Study of twisted Calabi flow connecting J-flow and Calabi flow on Kähler manifolds.

Investigate scalar curvature under geometric flows

Streets and Tian introduced pluriclosed flow and symplectic curvature flow in recent years. Here we construct a curvature flow to unify these two flows. We show the short time existence of our flow and exhibit an obstruction to long time existence.

We consider four extended Ricci flow systems---that is, Ricci flow coupled with other geometric flows---and prove dynamical stability of certain classes of stationary solutions of these flows. The systems include Ricci flow coupled with harmonic map flow (studied abstractly and in the context of Ricci flow on warped pr…

The article calculates the $\mathbb{F}$-convergence rate for Ricci flows with closed and smooth tangent flows.

Paper introduces Tensor Gauge Flow Models for better data encoding.