Spotlight method finds hidden errors in deep learning models.
problem Systematic errors in deep learning models on rare data subsets.
method Shining a spotlight on hidden layer representations to find poor performance areas.
result Identifies semantically meaningful areas of weakness in various models.
Transcribing content from structural images, e.g., writing notes from music scores, is a challenging task as not only the content objects should be recognized, but the internal structure should also be preserved. Existing image recognition methods mainly work on images with simple content (e.g., text lines with charact…
Recently, deep neural networks have significant progress and successful application in various fields, but they are found vulnerable to attack instances, e.g., adversarial examples. State-of-art attack methods can generate attack images by adding small perturbation to the source image. These attack images can fool the …
For research to go in the right direction, it is essential to be able to compare and quantify performance of different algorithms focused on the same problem. Choosing a suitable evaluation metric requires deep understanding of the pursued task along with all of its characteristics. We argue that in the case of applied…
Synthetic experiments are crucial for assessing causal machine learning methods.
problem Current empirical evaluations of causal machine learning methods are insufficient and unreliable.
method Propose principles for conducting rigorous empirical analyses with synthetic data.
result Rigorous synthetic experiments are essential for building trust in causal machine learning methods.
A new method for sampling complex posterior distributions in DDMs.
problem Challenging posterior distributions in DDMs.
method Divide-and-Conquer Posterior Sampling (DCPS)
result Significantly reduces approximation error without retraining.
Paper presents a Rashomon Quartet to show different model explanations.
problem Models with similar performance can explain data differently.
method Synthetic dataset with four equally effective models.
result Models with similar performance can explain data differently.
Review of diffusion priors for solving imaging inverse problems.
problem Solving inverse problems in imaging using diffusion priors.
method Categorizes approaches into explicit approximation and variational inference, sequential monte carlo, and decoupled data consistency.
result Systematic comparison of performance trade-offs across inverse problems.
HBR improves normative modeling of neuroimaging data across multiple sites.
problem Dealing with nuisance variation in neuroimaging data across different sites.
method Hierarchical Bayesian regression (HBR) for multi-site normative modeling.
result HBR provides more accurate normative ranges compared to existing methods.
This paper examines anomalies and frauds in blockchain networks and proposes detection techniques.
problem Anomalies and frauds undermine blockchain networks' integrity and security.
method Statistical and machine learning methods, game-theoretic solutions, digital forensics, reputation-based systems, and risk assessment techniques.
result Practical applications and insights for enhancing blockchain network security.
This paper reviews deep learning and knowledge-based methods for molecular design.
problem Optimizing molecular properties for scientific advances and process performance.
method Survey of deep learning and knowledge-based methods for molecular design.
result Deep learning models show promise in overcoming computational challenges.
The paper improves self-training in semi-supervised learning by selecting more robust pseudo-labeled data.
problem Improving the reliability of pseudo-labeled data selection in self-training for semi-supervised learning.
method Proposes a multi-objective utility function to select pseudo-labeled data that maximizes reliability, considering model selection, accumulation of errors, and covariate shift uncertainties.
result Robustness towards model choice can lead to substantial accuracy gains in self-training.
Sparse code multiple access (SCMA) has been one of non-orthogonal multiple access (NOMA) schemes aiming to support high spectral efficiency and ubiquitous access requirements for 5G wireless communication networks. Conventional SCMA approaches are confronting remarkable challenges in designing low complexity high accur…
This paper uses MIO to select features for kernel SVM classification.
problem Feature selection for kernel SVM classification.
method Mixed-integer optimization (MIO) for feature subset selection.
result The MIO approach can often outperform linear-SVM-based methods in prediction performance.
Systematizes blockchain decentralization taxonomy and metrics.
problem Lack of a unified definition for blockchain decentralization.
method Formulated a taxonomy of five facets and developed metrics.
result Provided comprehensive insights into blockchain decentralization.
Study reveals RL game's embedding space is stratified, not a manifold.
problem Understanding the structure of RL game embeddings.
method Adapted Robinson's volume growth transform for RL setting.
result Token embedding space is stratified, not a manifold.
Study clusters Indian stocks using polyspectral means for nuanced market insights.
problem Analyzing temporal patterns and financial relationships in Indian stock market.
method k-means clustering algorithm applied to polyspectral means of stock data.
result Identified five distinctive clusters of stocks with varying ownership structures.
MINN-SA enhances cancer detection using TCR sequences with better interpretability.
problem Challenges in detecting cancers using TCR sequences due to one-to-many correspondence.
method Multiple Instance Neural Networks based on Sparse Attention (MINN-SA).
result MINN-SA achieves highest AUC scores on 10 cancer types compared to existing MIL approaches.
Introduces gradient decay in Softmax for better generalization.
problem Improving generalization performance in neural networks.
method Gradient decay hyperparameter in Softmax for varying gradient rates based on probability.
result Gradient decay rate affects generalization performance and can be tuned for better optimization.
Survey on biases in image analysis for industrial safety.
problem Bias in machine learning algorithms affects industrial safety-critical applications.
method Survey and analysis of recent advances in bias detection and mitigation.
result Need for new methods to detect and mitigate biases in image analysis for safety-critical applications.
Efficient SNN on Loihi achieves high gesture recognition accuracy.
problem Real-time gesture recognition using event-based sensors.
method Design and training of SNN, conversion from DNN, pre-processing of DVS data.
result 89.64% classification accuracy with 37 Loihi cores.
Deep neural networks (DNN)-based machine learning (ML) algorithms have recently emerged as the leading ML paradigm particularly for the task of classification due to their superior capability of learning efficiently from large datasets. The discovery of a number of well-known attacks such as dataset poisoning, adversar…
Model predicts methane emissions from oil sands tailing ponds, suggesting significant environmental impact.
problem Estimating methane emissions from inactive oil sands tailing ponds.
method Physics constrained machine learning model using real-time weather data and laboratory experiments.
result Active oil sands tailing ponds emit between 950 to 1500 tonnes of methane per year, equivalent to 6000 gasoline vehicles.
Researchers found that avoiding synthetic data generation prevents model collapse in machine learning.
problem Model collapse in machine learning where models degenerate over generations.
method Comparing discard and augment workflows, focusing on Linear Regression.
result Theoretical evidence shows that for Linear Regression, test risk is bounded by π²/6 of original data alone.
Improved iterative methods for risk parity portfolio weights.
problem Solving for portfolio weights in risk parity allocation.
method Enhanced CCD and Newton methods, including a rescaling step and improved initial guess.
result Improved CCD method is the best, three times faster with 40% fewer iterations.
We describe a novel optimization method for finite sums (such as empirical risk minimization problems) building on the recently introduced SAGA method. Our method achieves an accelerated convergence rate on strongly convex smooth problems. Our method has only one parameter (a step size), and is radically simpler than o…
A new method combines Laplace and Variational Bayes for scalable inference.
problem Complex models and large datasets make exact inference infeasible.
method Low-Rank Variational Bayes Correction (VBC) using Laplace method and Variational Bayes correction in a lower dimension.
result The method ensures scalability in both model complexity and data size.
Unified framework for model explanation methods based on feature removal.
problem Unclear relationships and preferences among various model explanation methods.
method Characterizes removal-based explanations along three dimensions.
result Unified 26 existing methods, including widely used approaches.
This work reviews and evaluates methods for predicting prediction intervals in regression problems.
problem Calibration of prediction intervals in regression problems.
method Four classes of methods: Bayesian, ensemble, direct interval estimation, and conformal prediction.
result Conformal prediction can be used as a general calibration procedure.
Derives kernel PCA with Nyström method for scalability.
problem Scalability of kernel PCA.
method Nyström method for kernel PCA.
result Provides scalable alternative to full kernel PCA.
In this paper, the author considers the numerical computation of CVA for large systems by Mote Carlo methods. He introduces two types of stochastic mesh methods for the computations of CVA. In the first method, stochastic mesh method is used to obtain the future value of the derivative contracts. In the second method, …
New method combines spectral and sparse methods for Gaussian processes.
problem Efficiently fitting Gaussian processes to large datasets.
method Orthogonally decoupled variational Fourier features.
result Competitive performance on synthetic and real-world data.
A comprehensive benchmark of 15 scRNA-seq imputation methods across various datasets and analyses.
problem Imputation of single-cell RNA sequencing data to recover latent transcriptional signals.
method Evaluation of 15 imputation methods across 30 datasets and 6 downstream analyses.
result Traditional methods generally outperform DL-based methods in scRNA-seq data analysis.
New methods using natural gradient for structured optimization.
problem Structured optimization problems.
method Structured second-order methods via natural gradient descent.
result Efficiency demonstrated on non-convex and deep learning problems.
Recently, {\it stochastic momentum} methods have been widely adopted in training deep neural networks. However, their convergence analysis is still underexplored at the moment, in particular for non-convex optimization. This paper fills the gap between practice and theory by developing a basic convergence analysis of t…
We investigate methods for pricing American options under the variance gamma model. The variance gamma process is a pure jump process which is constructed by replacing the calendar time by the gamma time in a Brownian motion with drift, which makes it a time-changed Brownian motion. In general, the finite difference me…
A new method speeds up deep neural network training.
problem Nonconvex optimization in deep neural networks.
method Scaled conjugate gradient method for nonconvex optimization.
result The method converges faster and achieves lower scores in practical applications.
We propose a new stochastic dual coordinate ascent technique that can be applied to a wide range of regularized learning problems. Our method is based on Alternating Direction Multiplier Method (ADMM) to deal with complex regularization functions such as structured regularizations. Although the original ADMM is a batch…
NCG methods improve shape optimization efficiency.
problem Shape optimization problems
method Nonlinear conjugate gradient methods
result NCG methods are efficient for shape optimization
We propose two localized Radial Basis Function (RBF) methods, the Radial Basis Function Partition of Unity method (RBF-PUM) and the Radial Basis Function generated Finite Differences method (RBF-FD), for solving financial derivative pricing problems arising from market models with multiple stochastic factors. We demons…
Proposes UTC method for stock price prediction with uncertainty quantification.
problem Lack of uncertainty estimates in stock prediction methods.
method Combines TC method with probabilistic modeling for point and uncertainty predictions.
result UTC method achieves higher returns and lower risks than baselines.
Survey of spectral, probabilistic, and deep metric learning methods.
problem Developing effective distance metrics for various machine learning tasks.
method Divided into spectral, probabilistic, and deep approaches, covering various techniques and their applications.
result Comprehensive overview of metric learning methods, including new developments and applications.
Various approaches to gene selection for cancer classification based on microarray data can be found in the literature and they may be grouped into two categories: univariate methods and multivariate methods. Univariate methods look at each gene in the data in isolation from others. They measure the contribution of a p…
A novel weighted feature selection method using fuzzy sets improves classification accuracy and stability.
problem Improving feature selection accuracy and stability in machine learning models.
method Combination of four feature selection methods using fuzzy sets and bootstrap.
result Our method achieved significantly higher stability than individual methods.
New method improves accuracy in computing implied volatility.
problem Computing implied volatility from the Black-Scholes model.
method Adaptive gradient descent optimizers for numerical computation.
result More accurate results compared to close form approximation and Newton-Raphson method.
The paper examines Wiener process for LID estimation methods.
problem Estimating local intrinsic dimension in high-dimensional datasets.
method Investigates recent LID estimation methods from a Wiener process perspective.
result Explains how methods behave under non-ideal conditions.
We evaluate how modern outlier detection methods perform in identifying outliers in e-commerce conversion rate data. Based on the limitations identified, we then present a novel method to detect outliers in e-commerce conversion rate. This unsupervised method is made more business relevant by letting it automatically a…
Spectral methods of moments provide a powerful tool for learning the parameters of latent variable models. Despite their theoretical appeal, the applicability of these methods to real data is still limited due to a lack of robustness to model misspecification. In this paper we present a hierarchical approach to methods…