arXiv research

We study large-scale classification problems in changing environments where a small part of the dataset is modified, and the effect of the data modification must be quickly incorporated into the classifier. When the entire dataset is large, even if the amount of the data modification is fairly small, the computational …

A new method for effective VAE training using calibrated decoders.

Proposes new methods for inference in GLMs without assuming model correctness.

Computational methods that predict differential gene expression from histone modification signals are highly desirable for understanding how histone modifications control the functional heterogeneity of cells through influencing differential gene regulation. Recent studies either failed to capture combinatorial effects…

MCD automates counterfactual design searches for multi-modal tasks.

A new method improves continual learning by replaying pseudo data and using orthogonal weight modification.

Representing entities and relations in an embedding space is a well-studied approach for machine learning on relational data. Existing approaches, however, primarily focus on improving accuracy and overlook other aspects such as robustness and interpretability. In this paper, we propose adversarial modifications for li…

Label smoothing improves model robustness against misspecification.

Proposes modifications to model-based forests for HTE estimation in observational data.

This work improves testing of machine learning model modifications using novel statistical methods.

A new framework for offline RL improves policy flexibility and regularity.

New algorithms estimate matrix norms without matrix multiplication.

We propose a new variational inference algorithm for learning in Gaussian Process State-Space Models (GPSSMs). Our algorithm enables learning of unstable and partially observable systems, where previous algorithms fail. Our main algorithmic contribution is a novel approximate posterior that can be calculated efficientl…

New method detects RNA modifications without prior training, revealing novel sites.

Approves updates to machine learning models in healthcare based on accumulating data.

Kernel testing compares cell states in single-cell data.

We define an operation on homology ${B}^4$ which we call an $n$-twist annulus modification. We give a new construction of smoothly slice knots and exotically slice knots via $n$-twist annulus modifications. As an application, we present a new example of a smoothly slice knot with non-slice derivatives. Such examples we…

We show that the driving force behind the regularizing effect of Laplacian smoothing on surface elements is the popular mean ratio quality measure. We use these insights to provide natural generalizations to polygons and polyhedra. The corresponding functions measuring the quality of meshes are easily seen to be convex…

Meta-learning performance improved by keeping support sets fixed.

A modification of the confidence screening mechanism based on adaptive weighing of every training instance at each cascade level of the Deep Forest is proposed. The idea underlying the modification is very simple and stems from the confidence screening mechanism idea proposed by Pang et al. to simplify the Deep Forest …

Proposes simplified SHAP for faster black-box model explanations.

Behavior modification improves prediction accuracy by nudging user behavior.

A hybrid algorithm fuses significance-based splitting with honest sample-splitting for estimating heterogeneous treatment effects.

Study of unimodular Sasaki and Vaisman Lie groups, determining all modifications explicitly.

ContextBench benchmarks methods for generating linguistically fluent inputs that activate specific latent features in language models.

PAMS is a Python-based platform for simulating artificial markets.

Method explains anomaly detection by generating normal modifications.

We study Khovanov homology classes which have state cycle representatives, and examine how they interact with Jacobsson homomorphisms and Lee's map $Φ$. As an application, we describe a general procedure, quasipositive modification, for constructing H-thick knots in rational Khovanov homology. Moreover, we show that sp…

Understanding and evaluating the robustness of neural networks under adversarial settings is a subject of growing interest. Attacks proposed in the literature usually work with models trained to minimize cross-entropy loss and output softmax probabilities. In this work, we present interesting experimental results that …

The tick value is a crucial component of market design and is often considered the most suitable tool to mitigate the effects of high frequency trading. The goal of this paper is to demonstrate that the approach introduced in Dayri and Rosenbaum (2015) allows for an ex ante assessment of the consequences of a tick valu…

Preserves hyperbolicity in link complements with two moves.

We propose a learning-based filter that allows us to directly modify a synthetic speech waveform into a natural speech waveform. Speech-processing systems using a vocoder framework such as statistical parametric speech synthesis and voice conversion are convenient especially for a limited number of data because it is p…

Natural images may lie on a union of disjoint manifolds rather than one globally connected manifold, and this can cause several difficulties for the training of common Generative Adversarial Networks (GANs). In this work, we first show that single generator GANs are unable to correctly model a distribution supported on…

In this study, we consider classification problems based on neural networks in data-imbalanced environment. Learning from an imbalanced data set is one of the most important and practical problems in the field of machine learning. A weighted loss function based on cost-sensitive approach is a well-known effective metho…

Pseudo-marginal Metropolis-Hastings (pmMH) is a powerful method for Bayesian inference in models where the posterior distribution is analytical intractable or computationally costly to evaluate directly. It operates by introducing additional auxiliary variables into the model and form an extended target distribution, w…

We propose a modification of the three-manifold invariant based on the use of Euclidean metric values ascribed to the elements of manifold triangulation. We thus obtain a nontrivial invariant that can, in particular, distinguish non-homeomorphic lens spaces.

Surrogate Data Analysis (SDA) is a statistical hypothesis testing framework for the determination of weak chaos in time series dynamics. Existing SDA procedures do not account properly for the rich structures observed in stock return sequences, attributed to the presence of heteroscedasticity, seasonal effects and outl…

Paper proposes using pairwise feature comparisons to infer modification costs for user recourse.

A number of applications (e.g., AI bot tournaments, sports, peer grading, crowdsourcing) use pairwise comparison data and the Bradley-Terry-Luce (BTL) model to evaluate a given collection of items (e.g., bots, teams, students, search results). Past work has shown that under the BTL model, the widely-used maximum-likeli…

We briefly review the approach to optimization of portfolios according to the theory of Markowitz and propose a further modification that can improve the outcome of the optimization process. The modification takes account of the entropic contribution from the time series used to compute the parameters in the Markowitz …

Max-Cut decision tree improves classification accuracy and reduces computation time.

GOAT improves graph matching speed and accuracy using optimal transport.

Inspired by the possibility that generative models based on quantum circuits can provide a useful inductive bias for sequence modeling tasks, we propose an efficient training algorithm for a subset of classically simulable quantum circuit models. The gradient-free algorithm, presented as a sequence of exactly solvable …

In this paper we suggest a modification of the regression-based variance reduction approach recently proposed in Belomestny et al. This modification is based on the stratification technique and allows for a further significant variance reduction. The performance of the proposed approach is illustrated by several numeri…

In this work we present a modification in the conventional flow of information through a LSTM network, which we consider well suited for RNNs in general. The modification leads to a iterative scheme where the computations performed by the LSTM cell are repeated over a constant input and cell state values, while updatin…

Our goal is to improve variance reducing stochastic methods through better control variates. We first propose a modification of SVRG which uses the Hessian to track gradients over time, rather than to recondition, increasing the correlation of the control variates and leading to faster theoretical convergence close to …

Bayesian approaches have become increasingly popular in causal inference problems due to their conceptual simplicity, excellent performance and in-built uncertainty quantification ('posterior credible sets'). We investigate Bayesian inference for average treatment effects from observational data, which is a challenging…

We analyze the complexity of Gibbs samplers for inference in crossed random effect models used in modern analysis of variance. We demonstrate that for certain designs the plain vanilla Gibbs sampler is not scalable, in the sense that its complexity is worse than proportional to the number of parameters and data. We thu…