Some statistical models are specified via a data generating process for which the likelihood function cannot be computed in closed form. Standard likelihood-based inference is then not feasible but the model parameters can be inferred by finding the values which yield simulated data that resemble the observed data. Thi…
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
48 results for “data difficulty”
New ensemble models classify mouse movement trajectories to assess survey question difficulty.
problem Assessing survey question difficulty based on respondents' interaction data.
method Ensemble models combining semi-metric-based weak learners to classify multivariate functional data.
result Improved survey data quality through better identification of respondent difficulty.
A new restart criterion for k-means++ improves clustering quality and adapts to data difficulty.
problem Arbitrary restart counts in k-means++ lead to inconsistent results and wasted computation.
method GTRC combines Good-Turing estimates, bounds, and user-specified tolerance to dynamically decide restarts.
result GTRC achieves clustering quality comparable to fixed restart counts, varying restarts based on data difficulty.
Fast approximate nearest neighbor (NN) search in large databases is becoming popular. Several powerful learning-based formulations have been proposed recently. However, not much attention has been paid to a more fundamental question: how difficult is (approximate) nearest neighbor search in a given data set? And which …
Measures difficulty of predictions to improve deep learning models.
problem Understanding and improving deep learning models.
method Introduces a measure called prediction depth to assess example difficulty.
result Surprising relationships between prediction depth and model performance.
New measure quantifies task difficulty for machine learning models.
problem Quantifying the inherent difficulty of machine learning tasks.
method Inductive bias complexity measure.
result Tasks requiring generalization over many dimensions are more difficult.
The difficulty of classification affects the weight matrices' heavy tail appearance in deep learning networks.
problem Understanding the spectral properties of weight matrices in deep learning networks.
method Spectral analysis of weight matrices in different modules of DNNs, classification difficulty as a driving factor for heavy tail appearance.
result Higher classification difficulty leads to more frequent appearance of heavy tails in weight matrices spectra.
Same but Different: Distant Supervision for Predicting and Understanding Entity Linking Difficultycs.CL
Entity Linking (EL) is the task of automatically identifying entity mentions in a piece of text and resolving them to a corresponding entity in a reference knowledge base like Wikipedia. There is a large number of EL tools available for different types of documents and domains, yet EL remains a challenging task where t…
One of the central difficulties of settling the -bounded curvature conjecture for the Einstein -Vacuum equations is to be able to control the causal structure of spacetimes with such limited regularity. In this paper we show how to circumvent this difficulty by showing that the geometry of null hypersurfaces of En…
Improved PAC-Bayesian bounds by considering example difficulty.
problem Improving generalization bounds in machine learning.
method Introducing a modified excess risk that leverages example difficulty to reduce variance and tighten PAC-Bayesian bounds.
result Tighter PAC-Bayesian generalization bounds for machine learning models.
Bayesian model identifies skill difficulties and student subgroups in engineering education.
problem Identifying and supporting diverse student needs in entry-level university engineering modules.
method Hierarchical Bayesian modeling of student response data.
result Clear patterns of skill mastery and distinct student subgroups identified.
A new method estimates uncertainty without explicit prediction models.
problem Costly data acquisition in machine learning.
method Distance-weighted Class Impurity method for uncertainty estimation.
result Distance-weighted Class Impurity effectively estimates uncertainty without prediction models.
Time-continuous emotion prediction has become an increasingly compelling task in machine learning. Considerable efforts have been made to advance the performance of these systems. Nonetheless, the main focus has been the development of more sophisticated models and the incorporation of different expressive modalities (…
Traditional statistical analysis requires that the analysis process and data are independent. By contrast, the new field of adaptive data analysis hopes to understand and provide algorithms and accuracy guarantees for research as it is commonly performed in practice, as an iterative process of interacting repeatedly wi…
Lazy vs hasty: linearization in deep networks impacts learning schedule based on example difficultycs.LG
Deep networks prioritize easier examples over harder ones, leading to faster training.
problem Understanding how deep networks prioritize examples of varying difficulty.
method Investigated the effect of linear vs non-linear learning modes on example difficulty.
result Non-linear dynamics tend to sequentialize the learning of examples of increasing difficulty.
Structural health monitoring is a condition-based field of study utilised to monitor infrastructure, via sensing systems. It is therefore used in the field of aerospace engineering to assist in monitoring the health of aerospace structures. A difficulty however is that in structural health monitoring the data input is …
Gradient boosting with randomized trees reduces discontinuities and complexity.
problem Discontinuities in regression functions due to sparse training data.
method Gradient boosting machine with partially randomized decision trees.
result Improves robustness and computational efficiency of gradient boosting.
Mathematical Reinforcement Learning faces a 'Two-Hump' problem due to sparse rewards and a scarcity of intermediate 'hard-but-solvable' instances.
problem Mathematical search problems in Reinforcement Learning
method Novel data generation techniques and algorithmic enhancements
result Substantial performance improvements over previous baselines
Constructs metrics with Q-curvature on manifolds with singularities.
problem Positive singular Q-curvature problem on compact manifolds with punctures.
method One-parameter family solutions, perturbation methods, gluing techniques, linearized operator mapping properties.
result One-parameter family of solutions constructed for positive Q-curvature.
This paper applies secure multi-party computation to K-means clustering to protect private data.
problem Privacy-preserving K-means clustering for distributed private data.
method Secure multi-party computation (MPC) techniques to protect private data during K-means clustering.
result Privacy-preserving K-means clustering is feasible and effective for both horizontal and vertical data distribution.
Item Response Theory (IRT) aims to assess latent abilities of respondents based on the correctness of their answers in aptitude test items with different difficulty levels. In this paper, we propose the -IRT model, which models continuous responses and can generate a much enriched family of Item Characteristic Cur…
Increasingly complex generative models are being used across disciplines as they allow for realistic characterization of data, but a common difficulty with them is the prohibitively large computational cost to evaluate the likelihood function and thus to perform likelihood-based statistical inference. A likelihood-free…
Deep learning based medical image diagnosis has shown great potential in clinical medicine. However, it often suffers two major difficulties in practice: 1) only limited labeled samples are available due to expensive annotation costs over medical images; 2) labeled images may contain considerable label noises (e.g., mi…
Data imbalance remains one of the most widespread problems affecting contemporary machine learning. The negative effect data imbalance can have on the traditional learning algorithms is most severe in combination with other dataset difficulty factors, such as small disjuncts, presence of outliers and insufficient numbe…
Two-sample feature selection is the problem of finding features that describe a difference between two probability distributions, which is a ubiquitous problem in both scientific and engineering studies. However, existing methods have limited applicability because of their restrictive assumptions on data distributoins …
Curriculum Learning - the idea of teaching by gradually exposing the learner to examples in a meaningful order, from easy to hard, has been investigated in the context of machine learning long ago. Although methods based on this concept have been empirically shown to improve performance of several learning algorithms, …
Transformers learn to adapt to different task difficulties and resist distribution shifts.
problem Understanding and optimizing a Transformer's performance across various task difficulties and distribution shifts.
method Analyzing a pretrained Transformer on a mixture distribution of tasks, proving optimal convergence rates.
result Transformers achieve optimal convergence rates on tasks of specific difficulty levels, robust to distribution shifts.
The paper explores when to prioritize easy or hard samples in learning tasks.
problem Determining the optimal order of learning easy or hard samples.
method Theoretical analyses and experiments were conducted to propose and validate four priority modes.
result Four priority modes (easy-first, hard-first, medium-first, two-ends-first) can be flexibly applied.
CLOPS improves deep learning for continuous physiological data.
problem Deep learning struggles with streaming, multi-sensor clinical data.
method CLOPS is a replay-based continual learning strategy.
result CLOPS outperforms state-of-the-art methods in continual learning scenarios.
Many real-world applications reveal difficulties in learning classifiers from imbalanced data. The rising big data era has been witnessing more classification tasks with large-scale but extremely imbalance and low-quality datasets. Most of existing learning methods suffer from poor performance or low computation effici…
Proposes a simple framework to balance task difficulty in multi-task learning.
problem Varying difficulty levels among different tasks in multi-task learning.
method Introduces a Balanced Multi-Task Learning (BMTL) framework that transforms training losses to balance task difficulty.
result Empirical studies show state-of-the-art performance of the proposed BMTL framework.
Symmetry in inverse problems leads to multiple solutions, but breaking symmetry helps deep learning.
problem Symmetry in physical systems causes multiple solutions in inverse problems, hindering deep learning.
method Careful symmetry breaking on training data helps solve inverse problems and improve deep learning performance.
result Symmetry breaking on training data significantly improves deep learning performance in inverse problems.
We propose a multi-scale stochastic volatility model in which a fast mean-reverting factor of volatility is built on top of the Heston stochastic volatility model. A singular pertubative expansion is then used to obtain an approximation for European option prices. The resulting pricing formulas are semi-analytic, in th…
Salzmann's legacy in mathematics documented.
problem Mathematical challenges faced by Salzmann.
method Comprehensive review of Salzmann's work and bibliography.
result Salzmann's far-reaching influence in mathematics.
Paper shows training can improve GCN performance without changing architecture.
problem Training difficulty of GCNs limits their performance.
method Identified and mitigated energy loss during training.
result Significant decrease in training difficulties and notable performance boost.
This work sets theoretical limits on meta-learning performance.
problem Understanding the difficulty of adapting machine learning models to real-world data distributions.
method Information-theoretic lower bounds on convergence rates for meta-learning algorithms.
result Theoretical bounds on parameter estimation error for hierarchical Bayesian models of meta-learning.
Proposes a context-aware approach to deep autoencoder novelty detection.
problem Challenges of static distribution in novelty detection.
method Semi-supervised network architecture with auxiliary labels for contextual information.
result Single model achieves performance of individually trained models on various contexts.
This study introduces balanced DRPS and OrderedLogitNN for better QDE of discrete-level questions.
problem Lack of ordinal regression methods and fair evaluation metrics for discrete-level QDE.
method Introduces balanced DRPS and OrderedLogitNN, fine-tunes BERT on RACE++ and ARC datasets.
result OrderedLogitNN outperforms other models on complex QDE tasks.
This work builds the connection between the regularity theory of optimal transportation map, Monge-Ampère equation and GANs, which gives a theoretic understanding of the major drawbacks of GANs: convergence difficulty and mode collapse. According to the regularity theory of Monge-Ampère equation, if the support of the …
New method for Bayesian neural networks reduces inference difficulty.
problem Difficulty in sample-based inference for Bayesian neural networks.
method Embracing mode-connectedness to link overparameterization and sampling difficulty.
result Practical guidelines and deep ensemble approach for effective SBI.
Learning Shrinks the Hard Tail: Training-Dependent Inference Scaling in a Solvable Linear Modelcs.LG
Learning shrinks hard tail, improving inference performance.
problem Improving inference performance in neural networks.
method Latent Instance Difficulty (LID) model analyzing fine-tuning of neural networks.
result Training-dependent inference scaling, with growing with sample size before saturating.
Study predicts firm defaults using machine learning on Italian credit data.
problem Predicting firm defaults to inform bank lending policies.
method Used large granular credit data from Italian Central Credit Register, combined with public balance sheet data, and applied ensemble techniques and random forest models.
result Ensemble techniques and random forest provide the best results for predicting firm defaults.
Artificial neural networks are simple and efficient machine learning tools. Defined originally in the traditional setting of simple vector data, neural network models have evolved to address more and more difficulties of complex real world problems, ranging from time evolving data to sophisticated data structures such …
Score matching is a popular method for estimating unnormalized statistical models. However, it has been so far limited to simple, shallow models or low-dimensional data, due to the difficulty of computing the Hessian of log-density functions. We show this difficulty can be mitigated by projecting the scores onto random…
Despite the significant advances in recent years, Generative Adversarial Networks (GANs) are still notoriously hard to train. In this paper, we propose three novel curriculum learning strategies for training GANs. All strategies are first based on ranking the training images by their difficulty scores, which are estima…
The economic crisis in Argentina around year 2002 provides a unique opportunity for Econophysics studies. The available data on individual income are analyzed to show that they correspond to non stationary states. However, the rather restricted size of the data survey imposes difficulties that must be overcome through …
Study reveals differences in label shift problem difficulty in supervised vs. unsupervised settings.
problem Label shift problem in non-parametric classification.
method Analysis of minimax rates in supervised and unsupervised settings, focusing on class conditional distributions estimation.
result A class proportion estimation approach is minimax rate-optimal in the unsupervised setting.
A Tutorial on Online Supervised Learning with Applications to Node Classification in Social Networkscs.LG
We revisit the elegant observation of T. Cover '65 which, perhaps, is not as well-known to the broader community as it should be. The first goal of the tutorial is to explain---through the prism of this elementary result---how to solve certain sequence prediction problems by modeling sets of solutions rather than the u…