New method improves variable importance in random forests.
problem MDA's inconsistency in random forests.
method Theoretical analysis and development of Sobol-MDA.
result Sobol-MDA consistently estimates forest accuracy decrease.
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,738 papers · 148 categories
Trend · papers per month
26 results for “MDA”
Novel bounds for deep MDA algorithms improve performance and efficiency.
problem Improving performance of MDA algorithms with few target labels and pseudo labels.
method Information-theoretic tools and novel deep MDA algorithm.
result Algorithm-dependent generalization bounds for MDA.
New model uses financial filings to predict bankruptcy, even without MDA sections.
problem Lack of complete MDA data limits traditional bankruptcy prediction models.
method Conditional Multimodal Discriminative (CMMD) model learns from accounting, market, and textual data.
result Empirical results show superior classification performance compared to traditional models.
Survey explores methods to adapt deep learning models across multiple labeled domains.
problem Difficulty in obtaining labeled data for deep learning models.
method Multi-source domain adaptation (MDA) to transfer knowledge from labeled to unlabeled or sparsely labeled target domains.
result MDA methods improve performance by minimizing domain shift.
EGO-MDA identifies optimal spectral-bands for process discrimination.
problem Optimal spectral-bands for process discrimination.
method EGO-MDA, an unsupervised method using EGO and Mixture Discriminant Analysis.
result EGO-MDA achieves at least 70% improvement in median deviance.
Domain generalization (DG) aims to incorporate knowledge from multiple source domains into a single model that could generalize well on unseen target domains. This problem is ubiquitous in practice since the distributions of the target data may rarely be identical to those of the source data. In this paper, we propose …
Nonparametric two sample testing is a decision theoretic problem that involves identifying differences between two random variables without making parametric assumptions about their underlying distributions. We refer to the most common settings as mean difference alternatives (MDA), for testing differences only in firs…
MDA optimizer performs similarly to SGD+M in CV and Adam in NLP.
problem Performance degradation due to choosing the wrong optimizer.
method Modernized Dual Averaging (MDA) optimizer, inspired by dual averaging.
result MDA performs as well as SGD+M in CV and as Adam in NLP.
Study shows MDA's effectiveness even when more components are assumed than in actual data.
problem Classification error in overspecified Mixture Discriminant Analysis.
method Two-component Gaussian mixture model, EM algorithm, theoretical analysis of convergence and error rates.
result EM algorithm converges exponentially fast to Bayes risk with suitable initialization.
Transfer learning methods for reinforcement learning (RL) domains facilitate the acquisition of new skills using previously acquired knowledge. The vast majority of existing approaches assume that the agents have the same design, e.g. same shape and action spaces. In this paper we address the problem of transferring pr…
A stability metric compares feature selection algorithms in machine learning.
problem Stability of feature selection algorithms in machine learning.
method Rank-based instability index to compare MDA, LIME, and SHAP algorithms.
result LIME and SHAP are more stable than MDA, with LIME being best for human interpretability.
Researchers identify valid auxiliary functions for extreme value distributions and their max-domains of attraction.
problem Characterize valid auxiliary functions for extreme value distributions and their max-domains of attraction.
method Introduced 'universal' auxiliary functions valid for both VR and vMR representations, identified sets of valid auxiliary functions, and proposed a method for finding appropriate auxiliary functions.
result Characterized valid auxiliary functions for both VR and vMR representations for the entire MDA distribution families.
We investigate a Gaussian mixture model (GMM) with component means constrained in a pre-selected subspace. Applications to classification and clustering are explored. An EM-type estimation algorithm is derived. We prove that the subspace containing the component means of a GMM with a common covariance matrix also conta…
This paper forecasts cryptocurrency log-returns using LASSO-VAR and sentiment analysis.
problem Forecasting log-returns of cryptocurrencies using social media sentiment.
method LASSO-VAR model combined with Twitter and Reddit sentiment data.
result The model predicts the correct direction of cryptocurrency returns more than 50% of the time.
Machine Learning (ML) solutions are nowadays distributed, according to the so-called server/worker architecture. One server holds the model parameters while several workers train the model. Clearly, such architecture is prone to various types of component failures, which can be all encompassed within the spectrum of a …
New framework for evaluating ad auctions using stochastic modeling.
problem Challenges in evaluating deterministic ad auctions.
method Repurposed bid landscape model to approximate propensity scores, enabling robust OPE estimators.
result Remarkable alignment with online A/B test results, achieving 92% MDA in CTR prediction.
Combines deep generative models with ensemble methods for subsurface property estimation.
problem Estimating spatially distributed subsurface properties from sparse measurements.
method Wasserstein Generative Adversarial Network (WGAN-GP) and Ensemble Smoother with Multiple Data Assimilation (ES-MDA).
result The proposed method outperforms variational inversion methods, especially for channelized and fractured fields.
The mirror descent algorithm (MDA) generalizes gradient descent by using a Bregman divergence to replace squared Euclidean distance. In this paper, we similarly generalize the alternating direction method of multipliers (ADMM) to Bregman ADMM (BADMM), which allows the choice of different Bregman divergences to exploit …
A new flow method solves the weighted Yamabe problem with boundary.
problem Solving the weighted Yamabe problem on metric measure spaces with boundary.
method Introduced a Yamabe-type flow with a specific geometric setup.
result Long-time existence and convergence of the flow proved.
We consider the problem of Probably Approximate Correct (PAC) learning of a binary classifier from noisy labeled examples acquired from multiple annotators (each characterized by a respective classification noise rate). First, we consider the complete information scenario, where the learner knows the noise rates of all…
In recent years, an increasing popularity of deep learning model for intelligent condition monitoring and diagnosis as well as prognostics used for mechanical systems and structures has been observed. In the previous studies, however, a major assumption accepted by default, is that the training and testing data are tak…
Deep learning speeds up pressure prediction in carbon storage reservoirs.
problem Accurately forecasting reservoir pressure in geologic carbon storage projects with sparse well data.
method Combining InSAR surface displacement data with deep learning and data assimilation techniques.
result Workflow can predict reservoir pressure with high efficiency and uncertainty quantification.
The paper proposes new strategies to exploit relationships between meta-tasks for better few-shot learning.
problem Few-shot learning struggles with domain gaps and poorly sampled data.
method Proposes exploiting relationships between meta-tasks to improve robustness and performance.
result Developed new learning objectives (MDA and MKD) to address domain gaps and improve robustness.
This paper extends mirror descent to Banach spaces with reproducing kernels.
problem Optimizing in Banach spaces with reproducing kernels.
method Mirror descent algorithm adapted for Banach spaces with reproducing kernels.
result Mirror descent achieves linear convergence in certain conditions and standard convergence in a constrained setting.
Combining deep learning and ensemble smoothers for better history matching.
problem Dealing with complex facies distributions in history matching.
method Using autoencoders and generative adversarial networks to parameterize facies models, applying distance-based localization.
result Improved history matching performance with deep learning parameterizations.
RegPred Net forecasts foreign exchange rates with improved accuracy and interpretability.
problem Multi-step forecasting of Foreign Exchange (FX) rates.
method Bayesian optimization for hyperparameter tuning of a multi-layered regression network.
result RegPred Net significantly outperforms other models in terms of RMSE and correlation metrics.