Research
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,742 papers · 148 categories

Trend · papers per month

199398597796 · Jun 202019922001200920172026
48 results for MAD optimization

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.

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.

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.

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…

2017-04-10abs ↗pdf ↗

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.

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.

Malware currently presents a number of serious threats to computer users. Signature-based malware detection methods are limited in detecting new malware samples that are significantly different from known ones. Therefore, machine learning-based methods have been proposed, but there are two challenges these methods face…

2019-09-15abs ↗pdf ↗

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.

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.

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.

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.

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.

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.

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\chi^2 and MAD tests.
result MAD test rejects Benford's Laws conformity, suggesting potential issues with reported financial data.

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.

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. …

2018-05-17abs ↗pdf ↗

The most important part of model selection and hyperparameter tuning is the evaluation of model performance. The most popular measures, such as AUC, F1, ACC for binary classification, or RMSE, MAD for regression, or cross-entropy for multilabel classification share two common weaknesses. First is, that they are not on …

2019-08-24abs ↗pdf ↗

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…

2012-12-10abs ↗pdf ↗

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…

2012-05-10abs ↗pdf ↗

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…

2013-02-26abs ↗pdf ↗

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.

Bayesian optimization reduces computational effort in aircraft design optimization.

problem High computational cost in industrial aircraft design optimization.
method Constrained Bayesian optimization (Super Efficient Global Optimization with Mixture of Experts)
result Significant computational efficiency improvements over existing Isight optimizers.

Bayesian optimization method tackles combinatorial spaces, scalable for large data.

problem Optimization over combinatorial categorical spaces in natural sciences.
method Combines variational optimization and continuous relaxations for gradient-based optimization.
result Method performs comparably to state-of-the-art methods while scaling well.

New algorithm solves complex stopping problems with robust optimization.

problem Solving complex stochastic optimal stopping problems.
method Simulation-based robust optimization with exact reformulation as a zero-one bilinear program.
result Developed polynomial-time heuristics and algorithms for practical solution.

When hyperparameter optimization of a machine learning algorithm is repeated for multiple datasets it is possible to transfer knowledge to an optimization run on a new dataset. We develop a new hyperparameter-free ensemble model for Bayesian optimization that is a generalization of two existing transfer learning extens…

2018-02-06abs ↗pdf ↗

New algorithms ensure reproducibility and optimal convergence in convex optimization.

problem Trade-off between reproducibility and convergence rate in convex optimization.
method Regularization-based algorithms for smooth convex minimization and minimax optimization.
result Achieves optimal reproducibility and near-optimal gradient complexity for various oracle settings.