activity
20172025
most citedOptimization of a Triangular Delaunay Mesh Generator using Reinforcement Learning

2 citations · 3 across the 8 of their papers we have counts for

collaborators

12 papers

cs.CG2025★ 2 cited

Optimization of a Triangular Delaunay Mesh Generator using Reinforcement Learning

Will Thacher, Per-Olof Persson, Yulong Pan

In this work we introduce a triangular Delaunay mesh generator that can be trained using reinforcement learning to maximize a given mesh quality metric. Our mesh generator consists…

math.PR2022

Probability bounds for random events under -wise independence

Karthik Natarajan, Arjun Kodagehalli Ramachandra, Colin Tan

A collection of random events is said to be -wise independent if any events among them are mutually independent. We characterise all probability measures with…

math.OC2022

Pairwise independent correlation gap

Arjun Ramachandra, Karthik Natarajan

In this paper, we introduce the notion of a ``pairwise independent correlation gap'' for set functions with random elements. The pairwise independent correlation gap is defined as…

stat.ML2022

A Nonparametric Approach with Marginals for Modeling Consumer Choice

Yanqiu Ruan, Xiaobo Li, Karthyek Murthy +1

Given data on the choices made by consumers for different offer sets, a key challenge is to develop parsimonious models that describe and predict consumer choice behavior while bei…

math.OC2022

Discrete Optimal Transport with Independent Marginals is #P-Hard

Bahar Taşkesen, Soroosh Shafieezadeh-Abadeh, Daniel Kuhn +1

We study the computational complexity of the optimal transport problem that evaluates the Wasserstein distance between the distributions of two K-dimensional discrete random vector…

math.OC2021★ 1 cited

Extremal Probability Bounds in Combinatorial Optimization

Divya Padmanabhan, Selin Damla Ahipasaoglu, Arjun Ramachandra +1

In this paper, we compute the tightest possible bounds on the probability that the optimal value of a combinatorial optimization problem in maximization form with a random objectiv…

cs.SI2020

Correlation Robust Influence Maximization

Louis Chen, Divya Padmanabhan, Chee Chin Lim +1

We propose a distributionally robust model for the influence maximization problem. Unlike the classic independent cascade model \citep{kempe2003maximizing}, this model's diffusion…

math.OC2020

Tight Probability Bounds with Pairwise Independence

Arjun Ramachandra, Karthik Natarajan

While useful probability bounds for pairwise independent Bernoulli random variables adding up to at least an integer have been proposed in the literature, none of these bou…

math.OC2019

Tree Bounds for Sums of Bernoulli Random Variables: A Linear Optimization Approach

Divya Padmanabhan, Karthik Natarajan

We study the problem of computing the tightest upper and lower bounds on the probability that the sum of dependent Bernoulli random variables exceeds an integer . Under know…

math.OC2018

Exploiting Partial Correlations in Distributionally Robust Optimization

Divya Padmanabhan, Karthik Natarajan, Karthyek R. A. Murthy

In this paper, we identify partial correlation information structures that allow for simpler reformulations in evaluating the maximum expected value of mixed integer linear program…

math.ST2018

On the heavy-tail behavior of the distributionally robust newsvendor

Bikramjit Das, Anulekha Dhara, Karthik Natarajan

Since the seminal work of Scarf (1958) [A min-max solution of an inventory problem, Studies in the Mathematical Theory of Inventory and Production, pages 201-209] on the newsvendor…

q-fin.RM2017

Worst-Case Expected Shortfall with Univariate and Bivariate Marginals

Anulekha Dhara, Bikramjit Das, Karthik Natarajan

Worst-case bounds on the expected shortfall risk given only limited information on the distribution of the random variables has been studied extensively in the literature. In this…