Augmented KRnet improves flow-based generative modeling by maintaining exact invertibility.
problem Maintaining exact invertibility in flow-based generative models.
method Integrates augmented dimensions into KRnet to achieve full nonlinear updates in two iterations, keeping exact invertibility.
result Augmented KRnet achieves full nonlinear updates in two iterations, maintaining exact invertibility.
VFlow enhances generative flows by augmenting data dimensions for better expressiveness.
problem Tractable generative flows have limited expressiveness due to fixed intermediate dimensions.
method Augment data with extra dimensions and learn a generative flow for both original and augmented data using variational inference.
result VFlow achieves state-of-the-art performance on CIFAR-10 with improved compactness.
AEALT uses autoencoders to reduce text embedding dimensions for improved efficiency.
problem High dimensionality of text embeddings hinders downstream tasks.
method Factor-augmented supervised learning with autoencoders.
result AEALT outperforms conventional deep-learning approaches.
New augmentations of twist knots found that can't be filled.
problem Finding augmentations of twist knots that cannot be filled by orientable Lagrangian fillings.
method Using a Floer-theoretic version of a result from microlocal sheaf theory, showing augmentations cannot be induced by algebraic tori.
result Established new examples of augmentations of Legendrian twist knots that cannot be induced by orientable Lagrangian fillings.
This thesis explores fast algorithms for large matrices and data augmentation to improve model efficiency.
problem Efficient handling of large models and data in scientific computing and machine learning.
method Randomized low-rank decomposition algorithms and data augmentation techniques.
result Improved sample efficiency and generalization of machine learning models.
Paper uses non-linear dimension reduction for better economic forecasting.
problem Analyzing economic effects of shocks in large datasets.
method Non-linear dimension reduction in factor-augmented vector autoregressions.
result Non-linear dimension reduction techniques improve forecasting, especially in volatile data.
SONODEs and ANODEs improve learning of second order dynamics.
problem Learning dynamics governed by second order laws.
method Extended adjoint sensitivity method and theoretical analysis of ANODEs.
result SONODEs and ANODEs can learn higher order dynamics efficiently.
Develops a statistical framework for self-supervised representation learning using data augmentation.
problem Lack of theoretical understanding of data augmentation in nonlinear settings.
method Augmentation invariant manifold learning framework and stochastic optimization algorithm.
result Improves downstream analysis by exploiting manifold's geometric structure and invariant property of augmented data.
In this paper we show how to augment classical methods for inverse problems with artificial neural networks. The neural network acts as a prior for the coefficient to be estimated from noisy data. Neural networks are global, smooth function approximators and as such they do not require explicit regularization of the er…
The use of orthogonal projections on high-dimensional input and target data in learning frameworks is studied. First, we investigate the relations between two standard objectives in dimension reduction, preservation of variance and of pairwise relative distances. Investigations of their asymptotic correlation as well a…
Data augmentation affects estimates' uncertainty and distribution in complex ways.
problem Understanding how data augmentation impacts the variance and limiting distribution of estimates.
method Developed an adaptation of Lindeberg's technique for block dependence.
result Data augmentation can increase rather than decrease uncertainty, and it may shift the double-descent peak of an empirical risk.
Paper develops a new estimator for high-dimensional panel data with common shocks.
problem Cross-sectionally dependent errors driven by common shocks in high-dimensional panel data.
method Factor-augmented sparse-group LASSO estimator combining MIDAS aggregation with latent factors.
result The estimator outperforms standard LASSO for prediction and estimation in settings with cross-sectional dependence.
This work shows dimension regularization can replace skip-gram negative sampling for graph embeddings, improving efficiency and performance.
problem Efficiently enforcing dissimilarity among node embeddings in graph learning.
method Dimension regularization as an alternative to skip-gram negative sampling.
result Dimension regularization is a more efficient approach to enforcing dissimilarity in graph embeddings.
Enhanced EEG classification using augmented covariance matrix.
problem Improving motor imagery classification from EEG signals.
method Proposes a new framework based on the augmented covariance matrix derived from an autoregressive model.
result The augmented covariance matrix outperformed state-of-the-art methods.
Efficiently solves Elastic Net in high dimensions with Newton method.
problem Feature selection in high-dimensional data with non-negligible collinearity.
method Semi-smooth Newton Augmented Lagrangian Method.
result Significantly reduces computational cost compared to competitors.
New method for collaborative learning with multiple distributions, minimizing sample size.
problem Learning accurate classifiers for multiple data distributions without a single universal classifier.
method Empirical Risk Minimization (ERM) on a modified hypothesis class, with computational hardness results.
result Sample-efficient learning is possible under a weaker realizability assumption.
The paper analyzes data augmentation for precision matrix estimation in high dimensions.
problem Precision matrix estimation in high-dimensional settings.
method Linear shrinkage estimators and data augmentation methods.
result Concentration bounds for the quadratic error of estimators.
The ability to detect sparse signals from noisy high-dimensional data is a top priority in modern science and engineering. A sparse solution of the linear system Aρ=b0 can be found efficiently with an l1-norm minimization approach if the data is noiseless. Detection of the signal's support from data corrupted b…
Novel bio-inspired masking for robust speech emotion recognition.
problem Noise degradation in speech emotion recognition.
method Cochlear cepstrogram-based contrastive learning with temporal and frequency masking.
result Improved speech emotion recognition performance on K-EmoCon benchmark.
Recent work used importance sampling ideas for better variational bounds on likelihoods. We clarify the applicability of these ideas to pure probabilistic inference, by showing the resulting Importance Weighted Variational Inference (IWVI) technique is an instance of augmented variational inference, thus identifying th…
Deep learning method clusters multi-view data matrices.
problem Clustering heterogeneous relational data matrices.
method Deep collective matrix tri-factorization (DCMTF).
result Discover latent clusters across input matrices and their associations.
FSGD uses latent factors to scale SGD for high-dimensional learning.
problem Scalable optimization in high-dimensional machine learning.
method Factor-Augmented SGD (FSGD) that operates on streaming data.
result Established theoretical framework for latent factor estimation error in SGD.
Proves regularity of harmonic maps into Teichmüller space.
problem Harmonic maps into Teichmüller space and their singularities.
method Analyzes harmonic maps from Riemannian domains to Teichmüller space with specific conditions.
result If a harmonic map intersects a stratum, it is entirely contained in that stratum.
This paper examines how labeling error affects contrastive learning and proposes data dimensionality reduction methods to mitigate its impact.
problem The impact of labeling error on the performance of contrastive learning.
method Data dimensionality reduction methods (e.g., SVD) are applied to reduce false positive samples and improve downstream classification accuracy.
result Data dimensionality reduction methods can mitigate the negative impacts of labeling error on downstream classification performance.
We present a growing dimension asymptotic formalism. The perspective in this paper is classification theory and we show that it can accommodate probabilistic networks classifiers, including naive Bayes model and its augmented version. When represented as a Bayesian network these classifiers have an important advantage:…
This article is an overview of supervised machine learning problems for regression and classification. Topics include: kernel methods, training by stochastic gradient descent, deep learning architecture, losses for classification, statistical learning theory, and dimension independent generalization bounds. Implicit re…
Enhances time-series regression trees with latent factors for robust financial analysis.
problem Handling predictors with measurement error, trends, seasonality, and missing data.
method Integrates latent stationary factors extracted via state-space methods into time-series regression trees.
result Factor-augmented trees provide a reliable approach for macro-finance problems, exemplified by the lead-lag effect between equity volatility and the business cycle.
Enhances SSL methods with depth cues for better image understanding.
problem Lack of depth cues in 2D image pixel maps limits SSL performance.
method Integrates depth signals from a pretrained monocular RGB-to-depth model into contrastive learning frameworks.
result Improves SSL methods' robustness and generalization with depth signals.
NA0CT2 improves tensor regression predictions with ℓ0 regularization.
problem Improving tensor regression predictions with structural information.
method Noise-Augmented ℓ0 regularization on Tucker decomposition. result Achieves exact ℓ0 regularization on core tensor in linear and generalized linear tensor regression. Data vectors are obtained from multiple domains. They are feature vectors of images or vector representations of words. Domains may have different numbers of data vectors with different dimensions. These data vectors from multiple domains are projected to a common space by linear transformations in order to search clos…
AIKAE enhances IKAE for long-term time series forecasting.
problem Limitation of dimension conservation in IKAE models.
method Augmented with a non-invertible encoder network.
result AIKAE improves long-term forecasting accuracy.
Study examines how data augmentation impacts optimization in linear regression.
problem Understanding how data augmentation schedules affect optimization in linear regression.
method Analyzed the effect of augmentation on optimization in linear regression with MSE loss, using classical convex optimization and recent work on implicit bias.
result Proved that under certain joint schedules for learning rate and augmentation scheme, augmented gradient descent converges and characterized the resulting minimum.
Data augmentation doesn't improve robustness, contrary to belief.
problem The effectiveness of data augmentation in improving model robustness is questioned.
method Taking a Domain Generalization viewpoint, the study examines the robustness of augmented representations.
result Augmented representations are not robust to distortions used during training.
Enhances anomaly detection in high dimensions with pretrained networks.
problem Difficult to characterize anomaly in high-dimensional data.
method Residual adaptation to adjust pretrained networks for anomaly detection.
result Significantly outperforms existing methods on anomaly detection benchmarks.
This paper improves auto-augment efficiency by sharing augmentation weights.
problem Efficient evaluation of augmentation policies for model training.
method Augmentation-Wise Weight Sharing (AWS) to create a fast yet accurate proxy task.
result Augmentation policies found achieve superior accuracies compared to existing methods.
Let X be a smooth projective complex variety of maximal Albanese dimension, and let L→X be a big line bundle. We prove that the moving Seshadri constants of the pull-backs of L to suitable finite abelian étale covers of X are arbitrarily large. As an application, given any integer k≥1, there exists an…
CNNs encode data augmentation transformations, especially in early layers.
problem Whether neural network features encode data augmentation transformations.
method Systematic approach using pre-trained vision models to predict augmentation transformations.
result Neural network features encode data augmentation transformations, especially in early layers.
WeMix improves data augmentation by correcting bias in deep learning.
problem Data augmentation's effectiveness is limited by data bias.
method Developed AugDrop and MixLoss algorithms to correct data bias.
result WeMix improves data augmentation performance through bias correction.
Survey of AI in finance covering models, strategies, and knowledge systems.
problem Challenges in applying AI to financial markets, especially in high-frequency trading.
method Systematic analysis of financial AI across predictive models, decision frameworks, and knowledge augmentation systems.
result Critical trade-offs and gaps between theoretical advances and practical implementation in financial AI.
CAMEL enhances manifold embedding and learning with curvature metrics.
problem High-dimensional data classification, dimension reduction, and visualization.
method CAMEL uses a Riemannian manifold with curvature metrics for enhanced expressibility and interpretability.
result CAMEL outperforms state-of-the-art methods on high-dimensional datasets.
A study on optimizing data augmentation weights for improved test-time predictions.
problem Improving robustness of predictions during testing with data augmentation methods.
method A weighted Test-Time Augmentation (TTA) approach based on variational Bayesian framework to optimize weights.
result Optimizing weights suppresses unwanted data augmentations and improves prediction performance.
Data augmentation can achieve the same statistical benefits as full augmentation up to an approximation error.
problem Data augmentation in learning problems
method Using Fourier analysis and representation theory of finite groups
result Partial data augmentation achieves the same minimax rates as full augmentation
Study fully augmented links in thickened torus, generalizing S3 results.
problem Classify and describe geometric properties of fully augmented links in thickened torus.
method Geometric analysis and decomposition of link complements into ideal right-angled torihedra.
result Proves Volume Density Conjecture for fully augmented links in thickened torus.
Data augmentation has been widely applied as an effective methodology to improve generalization in particular when training deep neural networks. Recently, researchers proposed a few intensive data augmentation techniques, which indeed improved accuracy, yet we notice that these methods augment data have also caused a …
A key challenge in leveraging data augmentation for neural network training is choosing an effective augmentation policy from a large search space of candidate operations. Properly chosen augmentation policies can lead to significant generalization improvements; however, state-of-the-art approaches such as AutoAugment …
SapAugment learns adaptive augmentation policies for better model training.
problem Fixed data augmentation methods often apply the same augmentation to all samples, ignoring sample difficulty.
method SapAugment adapts augmentation parameters based on training loss, learning a sample-adaptive policy.
result SapAugment achieves up to 21% relative reduction in word error rate on LibriSpeech dataset.
Automatically learns optimal data augmentation for image classification.
problem Finding optimal data augmentation hyperparameters is computationally demanding and requires domain knowledge.
method Proposes an online bilevel optimization framework to learn data augmentation parameters directly.
result Jointly trained method achieves comparable or better classification accuracy than hand-crafted data augmentation without an external validation loop.
In this paper, we show that popular Generative Adversarial Networks (GANs) exacerbate biases along the axes of gender and skin tone when given a skewed distribution of face-shots. While practitioners celebrate synthetic data generation using GANs as an economical way to augment data for training data-hungry machine lea…