Ortho-MADS optimizes SVM hyperparameters for better accuracy.
problem Optimizing hyperparameters for SVM with Gaussian kernel.
method Deterministic Mesh Adaptive Direct Search (MADS) with orthogonal directions (Ortho-MADS).
result Ortho-MADS consistently finds comparable or better solutions than other methods.
MadNet uses MAD optimization to enhance deep model robustness against adversarial attacks.
problem Defending deep models against adversarial attacks.
method Inspired by certificate defense, MAD optimization increases separability of class clusters and decreases sensitivity to small distortions.
result MadNet improves adversarial robustness compared to state-of-the-art methods.
Investigates MAD-RP portfolios for asset allocation.
problem Finding optimal asset allocation strategies.
method Uses MAD as risk measure and proposes computational formulations for MAD-RP portfolios.
result MAD-RP portfolios offer balanced risk and profitability.
Generative models can be unfair and unstable; new methods improve fairness and stability.
problem Generative models unfairly penalize minority data and suffer from MADness.
method Intentionally designed hypernetworks and regularization terms.
result Generative models are more fair, stable, and unbiased with new methods.
We propose MAD-GAN, an intuitive generalization to the Generative Adversarial Networks (GANs) and its conditional variants to address the well known problem of mode collapse. First, MAD-GAN is a multi-agent GAN architecture incorporating multiple generators and one discriminator. Second, to enforce that different gener…
Develops a new method for learning discrete distributions without embedding them in a continuous space.
problem Challenges in learning discrete distributions using current methodologies.
method Introduces a MAD invertible map and a mixed variational flow (MAD Mix) for discrete distributions.
result MAD Mix produces more reliable approximations than continuous-embedding flows.
MAD framework learns operators from physics-embedded data efficiently.
problem Data-driven methods require costly labeled datasets and model-driven techniques face efficiency-accuracy trade-offs.
method Integrates physical laws with data-driven learning to generate physics-embedded analytical solutions and synthetic data.
result Eliminates dependence on experimental or simulated training data, enabling efficient operator learning across multi-parameter systems.
I-MAD detects malware with high accuracy and interpretable results.
problem Detecting new malware samples and providing interpretable results.
method Galaxy Transformer network and interpretable feed-forward neural network.
result Significantly outperforms existing static malware detection models.
CutMix training technique improves spatial locality in Vision Transformers.
problem Improving spatial locality in Vision Transformers trained from scratch.
method Comparison of Baseline and Modern training protocols on CIFAR-10, CIFAR-100, and Tiny-ImageNet.
result CutMix training component significantly reduces Mean Attention Distance (MAD) in early layers of Vision Transformers.
The prevalence of networked sensors and actuators in many real-world systems such as smart buildings, factories, power plants, and data centers generate substantial amounts of multivariate time series data for these systems. The rich sensor data can be continuously monitored for intrusion events through anomaly detecti…
A new method compares image classifiers using adaptive sampling of natural images.
problem Evaluation of image classifiers on small, fixed test sets may not generalize to real-world images.
method Adaptive sampling from a large corpus of unlabeled images to maximize classifier discrepancies measured by WordNet hierarchy.
result Human labeling of model-dependent image sets reveals relative classifier performance.
HyperNOMAD automates deep neural network hyperparameter tuning.
problem Automating the calibration of hyperparameters in deep neural networks.
method Derivative-free optimization using MADS algorithm.
result Achieves comparable results to state-of-the-art methods.
A main goal of regression is to derive statistical conclusions on the conditional distribution of the output variable Y given the input values x. Two of the most important characteristics of a single distribution are location and scale. Support vector machines (SVMs) are well established to estimate location functions …
MADS improves time series imputation performance across real-world datasets.
problem Time series imputation challenges due to variability in data types.
method MADS uses SIRENs for high-fidelity signal reconstruction and a hypernetwork for generalization.
result MADS outperforms state-of-the-art methods on real-world datasets.
Paper analyzes adaptive ISTA with MAD for LASSO problem.
problem Finding solutions to LASSO problems without tuning λ. method Adaptive ISTA with median absolute deviation (MAD) for estimating noise level.
result Local linear convergence and global convergence of the algorithm.
Unified framework detects shifts in climate boundaries using GP regression and MAD test.
problem Challenges in quantifying and testing for temporal shifts in spatial boundaries from noisy data.
method Combines heteroskedastic GP regression with scaled MAD GET.
result No significant decade-scale changes in arid and semi-arid interfaces, but localized shifts during extreme droughts identified.
We present Manifold Alignment Determination (MAD), an algorithm for learning alignments between data points from multiple views or modalities. The approach is capable of learning correspondences between views as well as correspondences between individual data-points. The proposed method requires only a few aligned exam…
Mathematical conditions and practical computations for adversarial robustness measures are established.
problem Existence, uniqueness, and scalability of adversarial robustness measures for AI classifiers.
method Formulated and proven mathematical conditions for existence, uniqueness, and explicit analytical computation of minimal adversarial paths and distances. Practical computation demonstrated on various AI tools and synthetic benchmarks.
result Explicit mathematical conditions and practical computations for adversarial robustness measures are established.
The purpose of this research is to apply technical analysis of Sutte Indicator in stock trading which will assist in the investment decision making process i.e. buying or selling shares. This research takes data of "A" on the Indonesia Stock Exchange(IDX or BEI) 29 November 2006 until 20 September 2016 period. To see t…
SHIFT improves robustness in estimating dose-response functions with heavy-tailed contamination.
problem Outliers bias estimates of average dose-response functions in heavy-tailed data.
method SHIFT combines cross-fit nuisance orthogonalization, Welsch-loss, and defensive OLS refit.
result SHIFT reduces RMSE from 1.03 to 0.33 on localized contamination test.
Automates design of lightweight neural networks for image classification.
problem Designing efficient neural networks for edge devices with limited computational resources.
method Uses the Mesh Adaptive Direct Search (MADS) algorithm to optimize network architecture.
result Achieves comparable performance to standard methods with fewer design trials.
The classical mixture of Gaussians model is related to K-means via small-variance asymptotics: as the covariances of the Gaussians tend to zero, the negative log-likelihood of the mixture of Gaussians model approaches the K-means objective, and the EM algorithm approaches the K-means algorithm. Kulis & Jordan (2012) us…
New MCMC method improves sampling from multimodal distributions.
problem Sampling from multimodal distributions is challenging for classical MCMC methods.
method Interpolating along the diffusion path, preserving mode weights and mixing properties.
result MAD-Path sampler improves global exploration and mode-weight estimation.
Standard economic theory assumes that agents in markets behave rationally. However, the observation of extremely large fluctuations in the price of financial assets that are not correlated to changes in their fundamental value, as well as the extreme instance of financial bubbles and crashes, imply that markets (at lea…
Study improves portfolio risk estimation methods using robust covariance and CVaR constraints.
problem Improving portfolio risk estimation in the presence of financial data noise and extreme market conditions.
method Exploration of robust covariance estimators, application of CVaR constraints, use of K-means clustering in optimization.
result Robust covariance estimators can outperform market-weighted benchmarks, especially during bull markets.
Study tests UK FTSE-listed companies' financial data for Benford's Law conformity.
problem Ensuring the fairness of public revenue collection and reducing tax avoidance risks.
method Utilised pre-tax income and total assets data from 567 FTSE companies, tested for Benford's Laws conformity using χ2 and MAD tests. result MAD test rejects Benford's Laws conformity, suggesting potential issues with reported financial data.
A relatively recent advance in cognitive neuroscience has been multi-voxel pattern analysis (MVPA), which enables researchers to decode brain states and/or the type of information represented in the brain during a cognitive operation. MVPA methods utilize machine learning algorithms to distinguish among types of inform…
Optimizes variational autoencoder for detecting missing data in Mars rover transmissions.
problem Detecting missing data in Mars rover transmissions to prevent volume loss and corruption.
method Applies derivative-free optimization to tune variational autoencoder.
result Improves variational autoencoder's ability to detect missing data, aiding GDSA team.
Mixes higher-order simplicial complexes for data augmentation.
problem Lack of labeled data for complex systems with multiway interactions.
method Proposes mixup mechanisms for simplicial complexes, including linear and nonlinear mixup, and a convex clustering mixup.
result Synthetic simplicial complexes interpolate between existing data based on homomorphism densities.
Financial markets are notoriously complex environments, presenting vast amounts of noisy, yet potentially informative data. We consider the problem of forecasting financial time series from a wide range of information sources using online Gaussian Processes with Automatic Relevance Determination (ARD) kernels. We measu…
Simplifies denoising score matching for manifold learning.
problem Learning distributions on manifolds is computationally intensive.
method Modifies denoising score matching to implicitly account for the manifold.
result Reduces computational burden while maintaining efficiency.
Efficiently generates noiseless samples from noisy data using manifold hypothesis.
problem Generating samples from a distribution of images when training data is noisy.
method Introduces an extended score to reduce noise in off-manifold directions.
result The extended score can be used to generate noiseless samples efficiently.
We build a rigorous bridge between deep networks (DNs) and approximation theory via spline functions and operators. Our key result is that a large class of DNs can be written as a composition of max-affine spline operators (MASOs), which provide a powerful portal through which to view and analyze their inner workings. …
EPP scores interpret model performance better than traditional metrics.
problem Lack of interpretable and stable performance metrics for model selection and hyperparameter tuning.
method Introducing EPP (interpretable predictive power) rating system.
result EPP scores provide probabilistic interpretations of model performance differences.
This work tackles over-smoothing in GNNs and proposes methods to improve node representation quality.
problem Over-smoothing in GNNs leads to indistinguishable node representations across different classes.
method Developed quantitative metrics (MAD, MADGap) to measure smoothness and over-smoothness. Proposed two methods: MADReg and AdaGraph.
result Proposed methods effectively alleviate over-smoothing and improve GNN performance.
Machine learning basics: key principles and limitations.
problem Understanding machine learning principles and their limitations.
method Analysis of machine learning families, performance comparison, and model interpretation.
result Interpretable models are often sufficient and deep learning doesn't always outperform others.
The accuracy of the household electricity consumption forecast is vital in taking better cost effective and energy efficient decisions. In order to design accurate, proper and efficient forecasting model, characteristics of the series have to been analyzed. The source of time series data comes from Online Enerjisa Syst…
Time series modeling and forecasting has fundamental importance to various practical domains. Thus a lot of active research works is going on in this subject during several years. Many important models have been proposed in literature for improving the accuracy and effectiveness of time series forecasting. The aim of t…
New method clusters hydrological and sediment data for storm event analysis.
problem Analyzing storm events for water quality constituents like turbidity.
method Multivariate time series clustering of river discharge and sediment data.
result Clusters differ from 2-D hysteresis loop classifications.
It is very vital for suppliers and distributors to predict the deregulated electricity prices for creating their bidding strategies in the competitive market area. Pre requirement of succeeding in this field, accurate and suitable electricity tariff price forecasting tools are needed. In the presence of effective forec…
Examines algorithmic modeling across three cultures.
problem Tackles algorithmic modeling in different cultural contexts.
method Uses parametric regressions, interpretable algorithms, and complex algorithms.
result Extension of Leo Breiman's thesis to include cultural differences.
Playing repeated matrix games (RMG) while maximizing the cumulative returns is a basic method to evaluate multi-agent learning (MAL) algorithms. Previous work has shown that UCB, M3, S or Exp3 algorithms have good behaviours on average in RMG. Besides, hedging algorithms have been shown to be effective on predi…
Meta-algorithm selection aims to choose the best algorithm selector for a given problem instance.
problem Selecting the best algorithm selector for a specific problem instance.
method Apply algorithm selection to the selection of other algorithms (meta-algorithm selection).
result Meta-algorithm selection can be beneficial in some cases but faces challenges in solving the meta-level problem.
Proposes CLRS benchmark to evaluate algorithmic reasoning.
problem Difficulty in transferring results across publications due to targeted algorithmic data.
method Develops a comprehensive benchmark covering various algorithmic tasks.
result Demonstrates performance of algorithmic reasoning baselines on the CLRS benchmark.
Combines multiple bandit algorithms to create a nearly optimal single algorithm.
problem Designing a single bandit algorithm that performs nearly as well as the best individual algorithm in a stochastic environment.
method Develops two general corralling algorithms that achieve favorable regret guarantees.
result The regret of the corralling algorithms is no worse than the best individual algorithm's performance.
We propose accelerated randomized coordinate descent algorithms for stochastic optimization and online learning. Our algorithms have significantly less per-iteration complexity than the known accelerated gradient algorithms. The proposed algorithms for online learning have better regret performance than the known rando…
The exchange algorithm is studied for its convergence and asymptotic variance.
problem Theoretical limitations of the exchange algorithm in sampling from doubly-intractable distributions.
method Theoretical analysis of the exchange algorithm's convergence speed and asymptotic variance.
result The exchange algorithm converges at a geometric rate and satisfies a Central Limit Theorem.
New algorithms optimize algorithm parameters in online settings with reduced computational costs.
problem Optimizing algorithm parameters in online settings with volatile and discontinuous losses.
method Developed semi-bandit optimization algorithms that leverage extra information to reduce computational costs.
result Achieved regret bounds as good as full-information feedback with significantly less computational effort.