Improves FI-PINNs by combining re-sampling and subset simulation for better failure probability estimation.
problem Estimating failure probability in physics-informed neural networks (PINNs).
method Adaptive sampling with re-sampling and subset simulation, using cosine-annealing for uniform to adaptive transition.
result Significant improvement in estimating failure probability and generating new training points in the failure region.
A new algorithm improves stochastic linear bandit performance using residual bootstrap.
problem Improving performance in stochastic linear bandit problems.
method Residual bootstrap exploration to estimate mean reward and pull the arm with the highest estimate.
result Proposed algorithm exttt{LinReBoot} achieves high-probability sub-linear regret under mild conditions.
M2m method improves deep learning performance on class-imbalanced datasets.
problem Class imbalance in labeled training datasets causes deep neural networks to generalize poorly to minority classes.
method Augment less-frequent classes by translating samples from more-frequent classes.
result Significantly improves generalization on minority classes compared to existing methods.
Deep learning algorithms can fare poorly when the training dataset suffers from heavy class-imbalance but the testing criterion requires good generalization on less frequent classes. We design two novel methods to improve performance in such scenarios. First, we propose a theoretically-principled label-distribution-awa…
Paper optimizes diffusion models for denoising tasks with theoretical guarantees.
problem Lack of theoretical understanding of MSE optimality in diffusion models.
method Inspired by MSE-optimal CME, proposes a novel denoising strategy for diffusion models.
result Demonstrates polynomial-time convergence to the CME under mild conditions.
CLARITY compares dissimilar datasets, identifying structural and relationship inconsistencies.
problem Integrating qualitatively different datasets from various disciplines.
method Non-parametric approach decomposing similarities into structural and relationship components.
result Identifies and interprets inconsistencies between datasets.
Classification on imbalanced datasets is a challenging task in real-world applications. Training conventional classification algorithms directly by minimizing classification error in this scenario can compromise model performance for minority class while optimizing performance for majority class. Traditional approaches…
In binary classification framework, we are interested in making cost sensitive label predictions in the presence of uniform/symmetric label noise. We first observe that 0-1 Bayes classifiers are not (uniform) noise robust in cost sensitive setting. To circumvent this impossibility result, we present two schemes; un…
Develops a cross-lingual hate speech detection model using pre-trained Transformers.
problem Detecting hate speech in low-resource languages.
method Utilizes frozen Transformer language models and AXEL attention-based classification block for zero-shot and few-shot learning.
result Demonstrates highly competitive results on English and Spanish subsets of the HatEval challenge.
Proposes CE-BASS for robust Kalman filtering with innovative and additive outliers.
problem Robustness to both innovative and additive outliers in Kalman filtering.
method Particle mixture Kalman filter with re-sampling of past states.
result CE-BASS efficiently handles multi-modality and trend changes in hidden state distributions.
Statistical estimates can often be improved by fusion of data from several different sources. One example is so-called ensemble methods which have been successfully applied in areas such as machine learning for classification and clustering. In this paper, we present an ensemble method to improve community detection by…
Efficient bandit exploration for various distributions without distribution-specific tuning.
problem Optimizing exploration in multi-armed bandit models for different distributions.
method Sub-sampling Duelling Algorithms (SDA) with Random Block sampling for efficient exploration.
result Achieves asymptotically optimal regret for Bernoulli, Gaussian, and Poisson distributions.
GANs generate samples from time series data.
problem Resampling dependent time series data.
method Generative Adversarial Networks (GANs) for time series resampling.
result GANs can outperform traditional bootstrapping methods in time series resampling.
This project was motivated by a dialysis study in northern Taiwan. Dialysis patients, after shunt implantation, may experience two types ("acute" or "non-acute") of shunt thrombosis, both of which may recur. We formulate the problem under the framework of recurrent events data in the presence of competing risks. In par…
The paper improves SMC algorithm for multi-modal distributions by proving variance bounds.
problem Problems with SMC on multi-modal distributions, especially in terms of mixing time.
method Proves variance bounds for SMC on multi-modal distributions using soft decomposition.
result Bounds on SMC variance depend on local rather than global mixing times.
Mixed linear regression involves the recovery of two (or more) unknown vectors from unlabeled linear measurements; that is, where each sample comes from exactly one of the vectors, but we do not know which one. It is a classic problem, and the natural and empirically most popular approach to its solution has been the E…
A fast, approximate method for variable selection in GLMs tackles correlated data.
problem Variable selection in generalized linear models with correlated data.
method Replica method of statistical mechanics and vector approximate message passing.
result The proposed algorithm provides fast convergence and high approximation accuracy.
In this paper, we discuss structure learning of causal networks from multiple data sets obtained by external intervention experiments where we do not know what variables are manipulated. For example, the conditions in these experiments are changed by changing temperature or using drugs, but we do not know what target v…
Methods for prediction and tolerance intervals in non-normal models.
problem Constructing prediction and tolerance intervals for non-normal data.
method Two approaches: pivotal quantity approximation and confidence interval for mean.
result Intuitive, simple, efficient methods with proper operating characteristics.
Enhances speech emotion recognition by adapting to varying time scales.
problem Robust emotion recognition from speech audio with temporal variations.
method Introduces multi-time-scale (MTS) convolutional layers to CNNs.
result MTS layers improve generalization, especially on smaller datasets.
This paper presents a novel generative model to synthesize fluid simulations from a set of reduced parameters. A convolutional neural network is trained on a collection of discrete, parameterizable fluid simulation velocity fields. Due to the capability of deep learning architectures to learn representative features of…
New algorithm borrows future randomness to stabilize model-free control.
problem Double sampling problem in model-free control with nonlinear approximations.
method Borrowing from the future (BFF) algorithm to approximate re-sampling of next states.
result BFF is close to unbiased SGD under smooth dynamics, validated by simulations.
New method improves smoothness of robot learning.
problem Jerky motion patterns on real robots from Deep RL exploration.
method Adapting state-dependent exploration to Deep RL algorithms with gSDE.
result Improved exploration and performance on real robots.
Study shows pre-trained models can handle long-tailed relations well, improving classifier performance.
problem Challenges in long-tailed relation classification due to class imbalance.
method Used instance-balanced sampling to pre-train models and then improved classifier performance through attentive relation routing.
result Robust classifier with attentive relation routing achieves better long-tailed classification ability.
ES-Single uses ES to estimate gradients in unrolled graphs, reducing variance and improving performance.
problem Estimating gradients in unrolled computation graphs with low variance and stability.
method Evolution strategies (ES) applied to unrolled graphs, with a single perturbation per particle.
result ES-Single reduces variance compared to PES, leading to better performance in various tasks.
Fisheye cameras are commonly used in applications like autonomous driving and surveillance to provide a large field of view (>180∘). However, they come at the cost of strong non-linear distortions which require more complex algorithms. In this paper, we explore Euclidean distance estimation on fisheye cameras …
A robust bandit algorithm uses Dirichlet sampling to minimize regret under various distributional assumptions.
problem Robustness of bandit algorithms to model misspecification.
method Dirichlet Sampling (DS) algorithm based on pairwise comparisons and re-sampling of arm observations.
result Different DS variants achieve optimal regret guarantees for bounded distributions and logarithmic regret for semi-bounded distributions.
There is a growing interest in using a longitudinal observational databases to detect drug safety signal. In this paper we present a novel method, which we used online during the OMOP Cup. We consider homogeneous ensembling, which is based on random re-sampling (known, also, as bagging) as a main innovation compared to…
Density sketches summarize data distributions for accurate sampling and estimation.
problem Accurately estimating and sampling from complex data distributions.
method Online algorithm generating additive density sketches.
result Density sketches provide statistically sound estimators and sampling capabilities.
Study shows resampling labels improves classifier performance in noisy data.
problem Balancing sample size vs label reliability in noisy data.
method Comparing different validation strategies and analyzing MNIST database with varying noise levels.
result Classifier performance declines with high incorrect labels, highlighting the importance of resampling.
Many machine learning algorithms are trained and evaluated by splitting data from a single source into training and test sets. While such focus on in-distribution learning scenarios has led to interesting advancement, it has not been able to tell if models are relying on dataset biases as shortcuts for successful predi…
Sequential Monte Carlo (SMC) methods have successfully been used in many applications in engineering, statistics and physics. However, these are seldom used in financial option pricing literature and practice. This paper presents SMC method for pricing barrier options with continuous and discrete monitoring of the barr…
Semi-supervised learning uses unlabeled data to improve fairness without sacrificing accuracy.
problem Discrimination in machine learning models.
method Pseudo labeling, re-sampling, ensemble learning.
result Unlabeled data can help achieve a better balance between accuracy and fairness.
New framework removes harmful momentum effect for long-tailed classification.
problem Challenges in maintaining balanced datasets with long-tailed data.
method Causal inference framework to disentangle and remove harmful effects of momentum.
result Achieves state-of-the-art performance on long-tailed visual recognition benchmarks.
This paper considers the recovery of a rank r positive semidefinite matrix XXT∈Rn×n from m scalar measurements of the form yi:=aiTXXTai (i.e., quadratic measurements of X). Such problems arise in a variety of applications, including covariance sketching of high-dimensional data…
This paper improves collaborative filtering by integrating user and item embeddings with attention.
problem Sparse ratings and limited robustness of Bayesian methods in collaborative filtering.
method Proposes a VAE-based Bayesian MF framework that leverages both data and embedding information.
result The proposed method enhances robustness and accuracy of collaborative filtering models.
Paper improves ML estimation from incomplete data with robust M-estimator.
problem Estimating parameters from incomplete data with improved accuracy.
method Developed a robust M-estimator and a sandwich estimator for standard errors.
result Improved estimation accuracy with smaller standard errors than ML estimates.
GOALS improves learning rate selection for dynamic MBSS in deep learning.
problem Challenges in selecting learning rates for dynamic MBSS in deep learning.
method Gradient-only approximation line search (GOALS) for dynamic MBSS loss functions.
result GOALS reduces model errors in multimodal cases.