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

Trend · papers per month

1.4%2.8%4.2%5.6% · Apr 199619922001200920172026
48 results for MAD Mix

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.

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.

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.

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.

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 ↗

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.

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.

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.

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.

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.

In this paper we deal with two classes of mixed metric 3-structures, namely the mixed 3-Sasakian structures and the mixed metric 3-contact structures. Firstly we study some properties of the curvature of mixed 3-Sasakian structures, proving that any manifold endowed with such a structure is Einstein. Then we prove the …

2008-03-13abs ↗pdf ↗

The paper explores knotoids, pseudo knotoids, braidoids, and pseudo braidoids on the torus.

problem The study of knotoids, pseudo knotoids, braidoids, and pseudo braidoids on the torus.
method Introducing new knotoid and braidoid concepts, isotopy theorems, state sum formulas, and Alexander and Markov theorems.
result Formulation and proof of Alexander and Markov theorems for mixed knotoids and mixed pseudo knotoids.

The literature on statistical learning for time series assumes the asymptotic independence or ``mixing' of the data-generating process. These mixing assumptions are never tested, nor are there methods for estimating mixing rates from data. We give an estimator for the ββ-mixing rate based on a single stationary sample…

2011-03-04abs ↗pdf ↗

Unified Minkowski problem discussed for (p,q)-mixed quermassintegrals.

problem Unified Minkowski problem for (p,q)-mixed quermassintegrals.
method Introducing (p,q)-mixed quermassintegrals and (p,q)-dual mixed curvature measure to study the Minkowski problem.
result Derivation of important properties and geometric inequalities for (p,q)-mixed quermassintegrals.

Mixed 3-structures are odd-dimensional analogues of paraquaternionic structures. They appear naturally on lightlike hypersurfaces of almost paraquaternionic hermitian manifolds. We study invariant and anti-invariant submanifolds in a manifold endowed with a mixed 3-structure and a compatible (semi-Riemannian) metric. P…

2010-09-30abs ↗pdf ↗

Characterizes measures preserving compound mixed renewal process properties.

problem Preserving compound mixed renewal process properties under different probability measures.
method Characterization of progressively equivalent probability measures.
result Any compound mixed renewal process can be converted into a compound mixed Poisson process through a change of measures.

Study on gradient descent in Hilbert spaces with Markov chains, focusing on mixing coefficients.

problem Analyzing convergence of gradient descent in Hilbert spaces with stationary Markov chains.
method Examined strictly stationary Markov chains with φφ- and ββ-mixing coefficients, derived probabilistic upper bounds.
result Probabilistic upper bounds on convergence behavior of gradient descent algorithm based on mixing coefficients.

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 ↗

Study on mixed Killing vector fields on Cigar Ricci-Bourguignon solitons.

problem Characterizing mixed Killing vector fields on Cigar Ricci-Bourguignon solitons.
method Analyzing the condition LVLVg=fLVgL_V L_V g = f\,L_V g and using rigidity phenomena.
result Dimension of complete mixed Killing fields is 5 and a basis is explicitly determined.

Study on Kähler manifolds with non-negative mixed curvature, proving splitting and structure theorems.

problem Investigating properties of Kähler manifolds with specific curvature conditions.
method Conformal perturbation method.
result Established structure and splitting theorems for Kähler manifolds with non-negative mixed curvature.

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 ↗

We show that all non-trivial continuous endomorphisms of the circle group are topologically mixing. We also show that there exists a large infinite class of continuous endomorphisms of any n-dimensional torus group which are topologically mixing. Lastly, we prove that any continuous endomorphism on an abelian polish se…

2016-06-21abs ↗pdf ↗

The paper explores the relationship between joint mixability and negative dependence structures.

problem Understanding the connection between joint mixability and various negative dependence concepts.
method Analyzes the properties of joint mixes and their relation to negative dependence structures.
result Derives necessary and sufficient conditions for a joint mix to be negatively dependent.