Paper introduces RKHM and KME for richer data analysis.
problem Lack of rich data structures in kernel methods.
method Proposes RKHM and KME for functional data analysis.
result RKHM captures structural properties in functional data.
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
48 results for “richer information”
Generative AI for Analystsq-fin.ST
Generative AI boosts analyst reports but increases forecast errors.
problem Improving financial analyst reports with AI.
method Natural experiment using FactSet's AI platform.
result AI-assisted reports are more comprehensive but lead to higher forecast errors.
Anticipatory portfolios use richer models to optimize investments.
problem Optimizing investments with richer models than used for calibration.
method Decision-theoretic definition of anticipation, quadratic geometry, and LQG decomposition.
result Correct anticipation creates value, vacuous anticipation has zero value, and misspecified anticipation is harmful.
Deep learning has recently led to great successes in tasks such as image recognition (e.g Krizhevsky et al., 2012). However, deep networks are still outmatched by the power and versatility of the brain, perhaps in part due to the richer neuronal computations available to cortical circuits. The challenge is to identify …
This paper aims to propose a novel deep learning-integrated framework for deriving reliable simulation input models through incorporating multi-source information. The framework sources and extracts multisource data generated from construction operations, which provides rich information for input modeling. The framewor…
We study graph matching with correlated Gaussian features and find thresholds for exact recovery.
problem Graph matching with correlated Gaussian features.
method Information-theoretic thresholds and conditions for exact and almost exact recovery.
result Contextual information introduces a richer structure, with thresholds for exact and almost exact recovery no longer coinciding.
Advances in unsupervised learning enable reconstruction and generation of samples from complex distributions, but this success is marred by the inscrutability of the representations learned. We propose an information-theoretic approach to characterizing disentanglement and dependence in representation learning using mu…
The study examines the balancedness of random partition models and finds the rich-get-richer characteristic is a result of model assumptions.
problem The balancedness of random partition models is largely neglected in the literature.
method Formulated a framework to define and study the balancedness of exchangeable random partition models, analyzed using product-form exchangeability and projectivity assumptions.
result The 'rich-get-richer' characteristic is an inevitable consequence of the model assumptions.
In order to use the advanced inference techniques available for Ising models, we transform complex data (real vectors) into binary strings, by local averaging and thresholding. This transformation introduces parameters, which must be varied to characterize the behaviour of the system. The approach is illustrated on fin…
Pref-SHAP explains preferences using Shapley values.
problem Challenging problem of preference explanation in machine learning.
method Shapley value-based model explanation framework for pairwise comparison data.
result Richer and more insightful explanations obtained over baseline.
New method approximates diffusion process posteriors using moment functions.
problem Approximating posteriors of stochastic differential equations.
method Constructs variational process as controlled prior, approximates posterior with moment functions, uses natural gradient descent.
result Richer variational approximations for state-dependent diffusion terms.
The paper explores tensor decompositions in deep learning models.
problem Compressing parameter space and creating richer representations.
method Tensor decompositions applied to deep learning models.
result Tensor methods can yield richer adaptive representations of complex data.
The rich-get-richer mechanism (agents increase their ``wealth'' randomly at a rate proportional to their holdings) is often invoked to explain the Pareto power-law distribution observed in many physical situations, such as the degree distribution of growing scale free nets. We use two different analytical approaches, a…
Improved time series classification with imputed data using label-guided forest-based methods.
problem Missing data in time series data.
method Label-guided imputation using forest-based proximity measures.
result Imputation leads to higher classification accuracies, even with imputed values differing from true values.
A novel unsupervised domain adaptation method using hierarchical optimal transport.
problem Unsupervised domain adaptation between source and target domains.
method Hierarchical optimal transport, leveraging class labels for structure formation in the source domain and learning probability measures in the target domain.
result The proposed HOT-DA method outperforms state-of-the-art approaches on various datasets.
Feature learning forms the cornerstone for tackling challenging learning problems in domains such as speech, computer vision and natural language processing. In this paper, we consider a novel class of matrix and tensor-valued features, which can be pre-trained using unlabeled samples. We present efficient algorithms f…
Traffic signal control is an important and challenging real-world problem, which aims to minimize the travel time of vehicles by coordinating their movements at the road intersections. Current traffic signal control systems in use still rely heavily on oversimplified information and rule-based methods, although we now …
Transfer learning improves loan recovery rate forecasting under data scarcity.
problem Data scarcity in loan portfolios limits RR modeling accuracy.
method Introduces FT-MDN-Transformer, a mixture-density tabular Transformer architecture for TL.
result FT-MDN-Transformer outperforms baseline models in RR forecasting, especially under covariate and conditional shifts.
Feature learning forms the cornerstone for tackling challenging learning problems in domains such as speech, computer vision and natural language processing. In this paper, we consider a novel class of matrix and tensor-valued features, which can be pre-trained using unlabeled samples. We present efficient algorithms f…
Paper bridges AI/ML and causal modeling to reduce bias.
problem Difficulty in combining methods from different assumptions.
method Integrates system dynamics and structural equation modeling.
result Unified mathematical framework for AI/ML and causal modeling.
Unsupervised domain adaptation improves with privileged information.
problem Domain adaptation under covariate shift and overlap limitations.
method Two-stage learning algorithm inspired by expected error analysis.
result Using privileged information reduces errors and increases sample efficiency.
New method quantifies feature interactions in machine learning models.
problem Capturing high-order interactions and feature contributions in predictive models.
method Information-theoretic approach using Conditional Mutual Information (CMI) via k-NN.
result Accurately recovers feature interactions in synthetic and real-world datasets.
Distance between evolving hypersurfaces is a PDE solution.
problem Tracking the distance between evolving hypersurfaces.
method Elliptic and parabolic PDEs, mean curvature flow.
result Local Harnack inequalities for the distance between evolving hypersurfaces.
The recent proliferation of knowledge graphs (KGs) coupled with incomplete or partial information, in the form of missing relations (links) between entities, has fueled a lot of research on knowledge base completion (also known as relation prediction). Several recent works suggest that convolutional neural network (CNN…
ContinuousNet generalizes ResNets to continuous dynamical systems.
problem ResNets fail to be meaningful dynamical integrators.
method Embedding continuous dynamical systems into higher-order numerical integration schemes (Runge Kutta).
result ContinuousNet exhibits invariance to discrete time step sizes and numerical integration schemes.
Meta-learning performance is affected by how task diversity is allocated, not just overall variability.
problem Meta-learning performance degrades when task diversity is unevenly distributed.
method Decomposed task-specific regression effects into structurally informative and orthogonal components.
result Meta-learning prediction degrades when a larger fraction of task variability is orthogonal and non-informative.
FeAT improves OOD generalization by learning richer features.
problem Improving feature learning for out-of-distribution (OOD) generalization.
method Feature Augmented Training (FeAT) iteratively augments and retains features from different subsets of training data.
result FeAT effectively learns richer features, boosting OOD performance.
Metric-based meta-learning techniques have successfully been applied to few-shot classification problems. In this paper, we propose to leverage cross-modal information to enhance metric-based few-shot learning methods. Visual and semantic feature spaces have different structures by definition. For certain concepts, vis…
Study uses sentiment analysis to predict implied volatility surface, improving prediction accuracy.
problem Improving prediction accuracy of implied volatility surface.
method Constructed daily high-frequency sentiment data, used VAR method, deep learning (BERT, LSTM), FFT, EMD for sentiment decomposition.
result High-frequency sentiment correlates with ATM options' implied volatility, low-frequency with DOTM options.
ECC Analyzer uses LLMs to predict stock volatility from ECCs.
problem Leveraging unstructured ECC data for stock volatility prediction.
method Uses large language models to extract and fuse textual and audio features from ECCs.
result ECC Analyzer outperforms traditional benchmarks in volatility prediction.
xAI-GAN improves GANs by providing richer feedback, enhancing image quality.
problem Challenges in GAN training, especially resource-intensive and data-intensive.
method Integrates xAI systems to provide richer corrective feedback from discriminators to generators.
result Improves image quality by up to 23.18% on MNIST and FMNIST datasets.
Enhances Ponzi scheme detection on Ethereum using time-aware metapaths.
problem Lack of temporal information in heterogeneous transaction graphs.
method Time-aware Metapath Feature Augmentation (TMFAug) module.
result Significant performance improvements in Ponzi scheme detection.
Graph InfoClust learns node representations by capturing cluster-level information, improving graph mining tasks.
problem Leveraging cluster-level node information for unsupervised graph representation learning.
method Graph InfoClust (GIC) uses a differentiable K-means method to compute clusters and jointly optimizes mutual information between nodes of the same cluster.
result GIC outperforms state-of-the-art methods in various downstream tasks with a 0.9% to 6.1% gain.
Proposes methods to include distributional information in MV-SDEs for better modeling of interacting particle systems.
problem Modeling the behavior of an infinite number of interacting particles with distributional information.
method Semi-parametric methods and estimators for MV-SDEs.
result Explicitly including distributional dependence improves performance in modeling temporal data with interaction.
Hybrid Amortized Inference improves PPG model interpretability.
problem Tension between PPG biomarker accuracy and clinical interpretability.
method Introduces PPGen for biophysical PPG signal-physiological parameter relation, and HAI for fast, robust estimation.
result Hybrid Amortized Inference accurately infers physiological parameters from PPG signals.
New method recovers graph latent positions under edge differential privacy.
problem Recovering latent graph information from privatized graphs.
method Applying geometric insights to adjust statistical inference for privatized graphs.
result Achieves consistent recovery of latent positions under local edge differential privacy constraints.
Automatically extracts hyperparameter schemas from AI library documentation.
problem Lack of machine-readable hyperparameter schemas for AI automation tools.
method Automatically mines Python docstrings in AI libraries to extract JSON Schemas.
result Effective at extracting machine-readable schemas from 119 AI models.
Fuzzy prediction sets generalize binary predictions to include elements at varying confidence levels.
problem Binary prediction sets are limited; fuzzy prediction sets offer richer guarantees.
method Generalize prediction sets to fuzzy sets, showing they are e-values with merging properties.
result Optimal e-values lead to optimal fuzzy prediction sets, including optimal conformal prediction.
Online surveys have the potential to support adaptive questions, where later questions depend on earlier responses. Past work has taken a rule-based approach, uniformly across all respondents. We envision a richer interpretation of adaptive questions, which we call dynamic question ordering (DQO), where question order …
Unified algorithm for efficient pure exploration using dual variables.
problem Efficiently achieving a specific goal through adaptive experimentation.
method Introducing dual variables to derive optimal allocation conditions, leading to Information-Directed Selection.
result Top-two Thompson sampling attains asymptotic optimality for Gaussian best-arm identification.
Multi-head attention mechanism is capable of learning various representations from sequential data while paying attention to different subsequences, e.g., word-pieces or syllables in a spoken word. From the subsequences, it retrieves richer information than a single-head attention which only summarizes the whole sequen…
Variational Bi-LSTMsstat.ML
Recurrent neural networks like long short-term memory (LSTM) are important architectures for sequential prediction tasks. LSTMs (and RNNs in general) model sequences along the forward time direction. Bidirectional LSTMs (Bi-LSTMs) on the other hand model sequences along both forward and backward directions and are gene…
Automatic Music Transcription (AMT) is one of the oldest and most well-studied problems in the field of music information retrieval. Within this challenging research field, onset detection and instrument recognition take important places in transcription systems, as they respectively help to determine exact onset times…
We propose regression networks for the problem of few-shot classification, where a classifier must generalize to new classes not seen in the training set, given only a small number of examples of each class. In high dimensional embedding spaces the direction of data generally contains richer information than magnitude.…
Study of Markov-modulated affine processes for richer models in finance.
problem Richer models in various applications.
method Martingale problem approach, characteristic function derivation, mathematical properties study.
result Existence and characteristic function of Markov-modulated affine processes.
Recovering edge activities from node activity data in temporal networks.
problem Recovering lost edge activity data from aggregated node activity data in temporal networks.
method Analyzing the relationship between edge activity and node activity data, using both theoretical and empirical methods to show recovery is possible and under what conditions.
result Recovery of edge activities from node activities is possible with surprising accuracy, even when network density increases.
Proposes a flexible neural recommendation framework for better prediction performance.
problem Data sparsity, cold start problem, and long-tail distribution in recommendations.
method A modular neural recommendation framework that includes a neural collaborative filtering part and a text processing part as a regularizer.
result Achieves better prediction performance than state-of-the-art text-aware methods using a simple text processing approach.
Empower efficient representation of distributions through moment-preserving methods.
problem Representing high-dimensional probability measures efficiently and accurately.
method Empower efficient representation of distributions through moment-preserving methods.
result Empowers efficient and accurate representation of high-dimensional probability measures.