Study describes limits of non-collapsing K3 surfaces using algebraic data.
problem Understanding limits of non-collapsing polarized K3 surfaces.
method Explicit description via period mapping and algebro-geometric data.
result Bubbling limits depend solely on algebro-geometric data.
The paper examines the reliability of limit order book representations in the face of data perturbation.
problem The reliability of limit order book representations under data perturbation.
method Experimental analysis of existing representations and guidelines for future research.
result Existing representations of limit order book data are vulnerable to data perturbation.
Paper proposes Universum GANs to improve GANs with limited labeled data.
problem Limited labeled data makes supervised learning challenging.
method Proposes Universum GANs with evolving discriminator loss.
result Improved discriminator accuracy and high quality data generation.
We show through case studies that it is easier to estimate the fundamental limits of data processing than to construct explicit algorithms to achieve those limits. Focusing on binary classification, data compression, and prediction under logarithmic loss, we show that in the finite space setting, when it is possible to…
Stabilizes GAN training with limited data.
problem Overfitting in GANs with scarce data.
method Adaptive discriminator augmentation.
result Good results possible with few thousand images.
Study integrates deep learning with financial data for improved trading strategies.
problem Enhancing predictive performance in algorithmic trading and portfolio optimization.
method Developed embedding techniques to treat limit order book snapshots as image-based input channels.
result Achieved state-of-the-art performance in high-frequency trading algorithms.
New method models PDEs from noisy, limited data.
problem Modeling PDEs with incomplete, noisy data.
method Learned linear transformation of spatial grid points, followed by dynamics learning in a reduced basis, then back transformation.
result Rapid high-resolution simulations with smaller training data sets.
We explore the plane-wave limit of homogeneous spacetimes. For plane-wave limits along homogeneous geodesics the limit is known to be homogeneous and we exhibit the limiting metric in terms of Lie algebraic data. This simplifies many calculations and we illustrate this with several examples. We also investigate the beh…
Study shows algorithms benefit from limited target data with many source domains.
problem Adapting to new domains with scarce labeled target data.
method New family of model selection algorithms.
result Beneficial guarantees in scenarios with limited target data.
Kernel methods are studied in a mean field limit for high-dimensional data.
problem Analyzing kernel methods in high-dimensional data with many variables.
method Investigation of kernel methods in the mean field limit of interacting particle systems.
result Rigorous mean field limit of kernels and detailed analysis of the limiting reproducing kernel Hilbert space.
The existing literature provides evidence that limit order book data can be used to predict short-term price movements in stock markets. This paper proposes a new neural network architecture for predicting return jump arrivals in equity markets with high-frequency limit order book data. This new architecture, based on …
TL-PCA uses transfer learning to improve PCA performance with limited target data.
problem PCA performance is limited with scarce target data.
method Transfer learning approach to PCA (TL-PCA) that combines source task knowledge with target task data.
result Improved PCA representation for dimensionality reduction with limited target data.
New optimal prior avoids bias in complex models with limited data.
problem Bias in inference from limited data using Jeffreys prior.
method Developed a principled choice of measure that avoids bias, dependent on data quantity.
result Optimal prior leads to unbiased inference in complex models.
CalNF models rare failures with limited data, improving safety in autonomous systems.
problem Challenges in modeling and debugging rare safety-critical failures due to limited data.
method CalNF, a self-regularized framework for posterior learning from limited data.
result Achieves state-of-the-art performance on data-limited failure modeling and inverse problems.
New insights into tSNE for large datasets.
problem Limitations of tSNE in handling large datasets.
method Identified continuum limit of tSNE objective function, proposed rescaled model.
result Rescaled model has a consistent limit for large datasets.
Paper tackles representation learning with limited labels from crowdsourced data.
problem Limited labeled data and inconsistent crowdsourced labels.
method Grouping-based deep neural network and Bayesian confidence estimator.
result Framework learns effective representations from limited data with crowdsourced labels.
New research limits how well attackers can guess if data points were in a model's training set.
problem Revealing membership of data points in machine learning models.
method Theoretical analysis of statistical limits for membership inference attacks.
result The effectiveness of membership inference attacks is limited by a constant that quantifies data distribution diversity.
The MBO scheme for data clustering is analyzed in the large data limit, proving convergence to optimal partition problems.
problem Analyzing the MBO scheme for data clustering in the large data limit.
method Implicit gradient descent on the thresholding energy of a similarity graph.
result The MBO scheme outcomes converge to minimizers of a weighted optimal partition problem.
Paper improves deep learning models for limit order book data.
problem Deep learning models' performance depends on robust input data representation.
method Identified and modified flaws in existing representations.
result Proposed modifications lead to state-of-the-art performance.
Paper proposes an intelligent credit limit management system using causal inference.
problem Traditional credit limit management strategies are heuristic and not data-driven.
method Conditional independence testing, response model, log transformation, GBDT encoding, non-linear transformation on features, well-designed metric.
result The proposed approach effectively manages credit limits and incorporates diminishing marginal effects.
Paper detects Trojan neural networks with limited or no data.
problem Robustness of DNNs against Trojan attacks in data-scarce scenarios.
method Proposes data-limited and data-free TrojanNet detectors.
result Demonstrates effectiveness of detectors on various datasets.
Study compares exponential and power-law kernels in modeling high-frequency trading data.
problem Modeling high-frequency trading data with specific kernel types.
method Proposes and analyzes two bivariate Hawkes processes with exponential and power-law kernels.
result Identifies strengths and limitations of exponential and power-law kernels for high-frequency trading data.
New algorithms improve decision-making with limited offline data.
problem Using limited offline data to cluster users for better decision-making.
method Proposed two algorithms: Off-C2LUB and Off-CLUB to address data insufficiency.
result Both algorithms outperform existing methods under limited offline user data.
This work proves the continuum limit of t-SNE for data visualization.
problem Understanding the theoretical basis of t-SNE from a continuum limit perspective.
method Proving the Kullback-Leibler divergence consistency as no∞ for t-SNE. result The continuum variational problem involving non-convex gradient regularization and penalty on probability density function magnitude.
Scientific fields such as insider-threat detection and highway-safety planning often lack sufficient amounts of time-series data to estimate statistical models for the purpose of scientific discovery. Moreover, the available limited data are quite noisy. This presents a major challenge when estimating time-series model…
Framework uses physics knowledge to improve spatiotemporal prediction with limited data.
problem Challenges in modeling physical systems with limited real-world data.
method Physics-aware meta-learning with auxiliary tasks, incorporating PDE-independent spatial and temporal modules.
result Framework outperforms in spatiotemporal prediction tasks with limited data.
Generative tools mimic stock market traders using synthetic data.
problem Imitating trading behavior of stock market participants.
method Modified state-space model applied to limit order book data, trained on synthetic data generated from a heterogeneous agent-based model.
result Model's predicted distribution matches ground truths from the agent-based model.
Method estimates model performance on external samples from limited statistical characteristics.
problem Limited access to multiple datasets due to privacy and commercial restrictions.
method Search for weights that match external statistics and are closest to uniform, using model performance on weighted internal sample as an estimation.
result Estimated external performance is closer to actual performance than internal performance.
New framework limits testing algorithmic stability under computational constraints.
problem Testing algorithmic stability is computationally hard.
method Unified framework for quantifying stability hardness.
result Exhaustive search is the only universally valid mechanism for certifying stability.
Graph Neural Network improves volatility forecasting for 500 S&P stocks.
problem Forecasting short-term realized volatility in a multivariate setting.
method Graph Transformer Network for Volatility Forecasting.
result Our model outperforms benchmarks on 500 S&P stocks.
New method combines multiple data sources for optimal decision-making with limited outcomes.
problem Optimal decision-making with limited outcome data from multiple heterogeneous sources.
method Calibrated optimal decision-making method leveraging common intermediate outcomes.
result Proposed estimator of conditional mean outcome is asymptotically normal and more efficient.
The paper analyzes PLS-SVD in high-dimensional data integration, revealing its strengths and limitations.
problem Understanding the behavior of PLS-SVD in high-dimensional data integration.
method Analysis using random matrix theory and singular value decomposition.
result PLS-SVD exhibits counter-intuitive or limiting behavior in certain regimes and outperforms PCA when detecting common latent subspace.
As online systems based on machine learning are offered to public or paid subscribers via application programming interfaces (APIs), they become vulnerable to frequent exploits and attacks. This paper studies adversarial machine learning in the practical case when there are rate limitations on API calls. The adversary …
Expands experimental design for causal discovery from limited data.
problem Challenges in causal discovery from observational and interventional data.
method Bayesian optimal experimental design incorporating recent advances in causal discovery.
result Active causal discovery of large, nonlinear SCMs with both intervention target and value selection.
Machine learning's predictive power is limited by sample size, as shown by the Limits-to-Learning Gap.
problem The limitations of machine learning in approximating true data-generating processes.
method Characterization of a universal lower bound (LLG) quantifying the discrepancy between empirical fit and population benchmark.
result Standard ML approaches can substantially understate true predictability in financial data.
Deep learning methods are becoming widely used for restoration of defects associated with fluorescence microscopy imaging. One of the major challenges in application of such methods is the availability of training data. In this work, we propose a unified method for reconstruction of multi-defect fluorescence microscopy…
In transmission X-ray microscopy (TXM) systems, the rotation of a scanned sample might be restricted to a limited angular range to avoid collision to other system parts or high attenuation at certain tilting angles. Image reconstruction from such limited angle data suffers from artifacts due to missing data. In this wo…
Study of limiting configurations for SU(1,2) Hitchin equation solutions.
problem Analyzing the behavior of solutions to the Hitchin equation for SU(1,2) Higgs bundles.
method Gluing construction and analysis of spectral data, focusing on limiting configurations.
result The limiting behavior of solutions is described by a metric on a Hecke modification of V singular at D. We briefly review data analysis of the Island order book, part of NASDAQ, which suggests a framework to which all limit order markets should comply. Using a simple exclusion particle model, we argue that short-time price over-diffusion in limit order markets is due to the non-equilibrium of order placement, cancellatio…
One of the big restrictions in brain computer interface field is the very limited training samples, it is difficult to build a reliable and usable system with such limited data. Inspired by generative adversarial networks, we propose a conditional Deep Convolutional Generative Adversarial (cDCGAN) Networks method to ge…
Managing the prediction of metrics in high-frequency financial markets is a challenging task. An efficient way is by monitoring the dynamics of a limit order book to identify the information edge. This paper describes the first publicly available benchmark dataset of high-frequency limit order markets for mid-price pre…
We introduce a new technique to solve period problems on minimal surfaces called limit-method. If a family of surfaces has Weierstrass-data converging to the data of a known example, and this presents a transversal solution of periods, then the original family contains a sub-family with closed periods.
Deep learning models complex multivariate extremes using geometric shapes.
problem Modeling complex extremal dependencies in high-dimensional data.
method Geometric representation and deep learning for flexible semi-parametric models.
result First approach to modeling limit sets using deep learning for high-dimensional data.
Meta two-sample testing uses auxiliary data to quickly find powerful tests from limited samples.
problem Challenges in identifying powerful kernels for distinguishing complex distributions with limited data.
method Introduces meta two-sample testing (M2ST) to leverage abundant auxiliary data on related tasks.
result Proposed algorithms improve over baselines and identify powerful tests from scarce observations.
A TCL framework improves causal effect estimation in limited data.
problem Improving causal effect estimation accuracy in limited data.
method Transfer Learning (TCL) with ℓ1 regularization for nuisance models.
result Non-asymptotic recovery guarantees for exttt{ℓ1-TCL} in high-dimensional settings. Regression models for limited continuous dependent variables having a non-negligible probability of attaining exactly their limits are presented. The models differ in the number of parameters and in their flexibility. Fractional data being a special case of limited dependent data, the models also apply to variables tha…
Stochastic gradient descent converges to universal limits in high dimensions.
problem Statistical tasks in high dimensions with specific data projections.
method Stochastic gradient descent applied to mixture distributions, proving universality of limits.
result The ODE limits are universal for mixtures of arbitrary product distributions.
SVR-Tree improves classification trees for imbalanced and sparse data.
problem Classification difficulties in imbalanced and sparse data.
method Proposes SVR-Tree, penalizing the Surface-to-Volume Ratio of decision sets.
result SVR-Tree improves generalization error compared to other imbalance algorithms.