Proposes a method to predict time series data using scale information.
problem Sequential data exhibits different behavior at different scales.
method Scale-based inference using k-nearest neighbors and sequential prediction. result Asymptotically, the algorithm produces the best prediction error.
New method selects diffusion scales for graph wavelets.
problem Choosing optimal diffusion scales for graph wavelets.
method Proposes an unsupervised method using information theory.
result Method selects diffusion scales for graph wavelets.
A new measure of model complexity based on Fisher Information.
problem Model complexity measurement in statistical models.
method Effective dimension defined by the number of cubes needed to cover the model space.
result The effective dimension is scale-dependent and measures model complexity.
Study utility indifference pricing with delayed investment information in a Bachelier model.
problem Investment decisions based on delayed information in a Bachelier model.
method Developed discrete-time duality and used techniques from [7] to compute scaling limits.
result Utility indifference prices scaling limit for vanishing delay with quadratic penalty.
Tensor networks reveal limitations for efficient text description but suggest potential for images.
problem Efficiently describing large text and image data sets using tensor networks.
method Investigation of mutual information scaling, introduction of mutual information estimators, and use of autoregressive and convolutional neural networks.
result Text data cannot be efficiently described by 1D tensor networks, while images may be better described by 2D tensor networks.
MCFNet recovers spatial detail and fuses it with semantic information for real-time segmentation.
problem Recovering spatial detail information and fusing it with semantic information in real-time.
method Proposes a new architecture (MCFNet) with feature refinement and fusion modules, and a gating unit.
result Achieves competitive performance with high speed (75.5% mIOU, 151.3 FPS on Cityscapes).
Proposes a new hyperprior and predictive criterion for weakly informative hyperprior in relevance vector machine.
problem Capturing non-homogeneous data structure with limited kernel functions.
method Uses inverse gamma hyperprior with a shape parameter close to zero and a scale parameter not close to zero. Applies multiple kernel method with different widths. Proposes extended predictive information criterion for scale parameter selection.
result Obtains a multiple kernel relevance vector regression model with good predictive accuracy.
Graph cross network improves graph classification accuracy.
problem Improving graph classification accuracy.
method Graph cross network (GXN) with vertex infomax pooling (VIPool) and feature-crossing layer.
result Improves graph classification accuracy by 2.12% and 1.15%.
A new deep learning framework captures multi-scale spatio-temporal dependencies.
problem Designing and analyzing deep learning models for complex spatio-temporal analytics.
method Developed an I2DRNN model with three modules for integrating and learning multi-scale spatio-temporal data. result The I2DRNN model outperforms classical and state-of-the-art models in capturing meaningful multi-scale spatio-temporal dependencies. Bayesian approach scores influential training examples for model predictions.
problem Enhance interpretability and safety of machine learning models.
method Formulate TDA as a Bayesian information-theoretic problem, scoring subsets by information loss.
result Method aligns with classical influence scores while promoting diversity for subsets.
SIMPGEN improves SWOT SSH data interpretation by removing noise and preserving fine-scale features.
problem Noisy data and limited fine-scale observations in oceanic processes.
method Simulation-Informed Metric and Prior for Generative Ensemble Networks (SIMPGEN) combining real SWOT observations with simulated reference data.
result SIMPGEN effectively removes noise, preserving fine-scale features better than existing neural methods.
We study super--replication of European contingent claims in an illiquid market with insider information. Illiquidity is captured by quadratic transaction costs and insider information is modeled by an investor who can peek into the future. Our main result describes the scaling limit of the super--replication prices wh…
We consider strictly stationary heavy tailed time series whose finite-dimensional exponent measures are concentrated on axes, and hence their extremal properties cannot be tackled using classical multivariate regular variation that is suitable for time series with extremal dependence. We recover relevant information ab…
KFT improves tensor forecasting by incorporating side information.
problem Tensor factorization weaknesses in latent factors.
method Kernel Fried Tensor (KFT) with variational inference.
result Superior performance over LightGBM and FFM.
Topology-enhanced loss improves 3D object reconstruction from 2D images.
problem Challenges in reconstructing 3D objects from 2D images, especially capturing shape information.
method Integrates multi-scale topological features into the reconstruction loss using cubical complexes and optimal transport distance.
result Topology-aware loss substantially improves 3D reconstruction quality.
CrossAD detects anomalies in time series data by considering cross-scale associations and cross-window modeling.
problem Anomaly detection in time series data is challenging due to varying patterns at different scales and fixed window sizes.
method CrossAD incorporates cross-scale reconstruction and a query library to capture dynamic cross-scale associations and comprehensive context.
result CrossAD achieves state-of-the-art performance in anomaly detection across multiple real-world datasets.
Extracts geometric information from point-clouds for multiclass classification.
problem Multiclass Classification with labeled point-clouds.
method Stochastic partial orderings and label embedding trees.
result Computes multiscale geometries for explainable prediction and error-free labeling.
Temperature scaling improves model uncertainty but not diversity in LLMs.
problem Improving the calibration and stochasticity of probabilistic models.
method Investigates theoretical properties of temperature scaling in classification and LLMs.
result Temperature scaling increases model uncertainty but not diversity in LLMs.
Analyzing and interpreting time-dependent stochastic data requires accurate and robust density estimation. In this paper we extend the concept of normalizing flows to so-called temporal Normalizing Flows (tNFs) to estimate time dependent distributions, leveraging the full spatio-temporal information present in the data…
Method scales up ML science by measuring multiple molecules at once.
problem Scaling up ML-driven science with wet lab experiments.
method Neural extension of compressed sensing for function space.
result Proves orders-of-magnitude gains in information density.
ADGAN improves risk tolerance prediction by aligning cross-domain data.
problem Lack of professional knowledge and domain-specific models in risk tolerance studies.
method Asymmetric cross-Domain Generative Adversarial Network (ADGAN) for domain scale inequality.
result ADGAN better handles class imbalance and unqualified data than state-of-the-art methods.
New PINN architectures learn high-frequency features using Fourier features.
problem PINNs struggle with high-frequency or multi-scale features.
method Employ spatio-temporal and multi-scale random Fourier features.
result Effective PINN models for multi-scale PDEs.
We present network embedding algorithms that capture information about a node from the local distribution over node attributes around it, as observed over random walks following an approach similar to Skip-gram. Observations from neighborhoods of different sizes are either pooled (AE) or encoded distinctly in a multi-s…
Network embedding represents nodes in a continuous vector space and preserves structure information from the Network. Existing methods usually adopt a "one-size-fits-all" approach when concerning multi-scale structure information, such as first- and second-order proximity of nodes, ignoring the fact that different scal…
We introduce a notion of measuring scales for quantum abelian gauge systems. At each measuring scale a finite dimensional affine space stores information about the evaluation of the curvature on a discrete family of surfaces. Affine maps from the spaces assigned to finer scales to those assigned to coarser scales play …
New method uses KL-divergence to create non-informative priors for multivariate Gaussian.
problem Handling hyperparameters for non-informative limits in multivariate Gaussian conjugate priors.
method Using scaled KL-divergence between multivariate Gaussians to construct Wishart and normal-Wishart conjugate priors.
result Forming non-informative priors without violating Wishart shape parameter restrictions.
Paper shows noisy labels can improve PLR variable selection.
problem Variable selection in PLR is challenging due to noisy labels.
method Proposes a novel ADMM-based algorithm to fuse noisy labels.
result Fused noisy labels improve PLR performance in estimation and classification.
Paper proposes PPMM for fast estimation of large-scale OTM.
problem Estimation of large-scale optimal transport maps (OTM) is challenging due to the curse of dimensionality.
method Combines projection pursuit regression and sufficient dimension reduction to adaptively select projection directions.
result PPMM consistently estimates the most informative projection direction and weakly converges to the target OTM.
Matched filters reveal optimal normalization methods for different market participants.
problem Optimizing signal extraction from order flow for market microstructure analysis.
method General matched filter principle applied to normalization strategies.
result Optimal normalization methods (e.g., SMC and STV) differ based on trader types. Recently, neural network based approaches have achieved significant improvement for solving large, complex, graph-structured problems. However, their bottlenecks still need to be addressed, and the advantages of multi-scale information and deep architectures have not been sufficiently exploited. In this paper, we theor…
Sequence models assign probabilities to variable-length sequences such as natural language texts. The ability of sequence models to capture temporal dependence can be characterized by the temporal scaling of correlation and mutual information. In this paper, we study the mutual information of recurrent neural networks …
The condition number predicts efficient information encoding in neural units, aiding model fine-tuning.
problem Efficient information encoding in neural units for various tasks and input modalities.
method Linking the condition number to the log-volume scaling factor and entropy of the output distribution.
result High condition number indicates efficient encoding, reducing overall information transfer.
NN-GPR improves climate model predictions by preserving fine-scale spatial information.
problem Dilution of fine-scale spatial information and bias in model averaging.
method Gaussian process regression with an infinitely wide deep neural network.
result NN-GPR produces more accurate and detailed climate projections.
Paper introduces multi-scale methods to improve CATE estimation from EO data.
problem Challenges in balancing fine-grained and contextual information in EO-based causal inference.
method Multi-Scale Representation Concatenation, combining Vision Transformer and Causal Forests.
result Multi-scale approach captures effect heterogeneity better than single-scale models.
Existing machine reading comprehension (MRC) models do not scale effectively to real-world applications like web-level information retrieval and question answering (QA). We argue that this stems from the nature of MRC datasets: most of these are static environments wherein the supporting documents and all necessary inf…
We define the intrinsic scale at which a network begins to reveal its identity as the scale at which subgraphs in the network (created by a random walk) are distinguishable from similar sized subgraphs in a perturbed copy of the network. We conduct an extensive study of intrinsic scale for several networks, ranging fro…
Improves speaker verification for variable-duration utterances using a feature pyramid module.
problem Improving robustness for variable-duration utterances in speaker verification.
method Integrates a feature pyramid module into multi-scale aggregation to enhance speaker-discriminative information from multiple layers.
result Improves performance for both short and long utterances compared to state-of-the-art approaches.
We develop an entropic framework to model the dynamics of stocks and European Options. Entropic inference is an inductive inference framework equipped with proper tools to handle situations where incomplete information is available. The objective of the paper is to lay down an alternative framework for modeling dynamic…
We apply information-based complexity analysis to support vector machine (SVM) algorithms, with the goal of a comprehensive continuous algorithmic analysis of such algorithms. This involves complexity measures in which some higher order operations (e.g., certain optimizations) are considered primitive for the purposes …
The study extracts market direction from transaction data.
problem Extracting market direction from transaction data.
method Dynamic equation with time scale selection from past transactions.
result Automatic determination of time scale for price calculation.
The paper studies scaling limits of Wasserstein metrics on Gaussian mixture models.
problem Understanding the scaling limits of Wasserstein metrics on Gaussian mixture models.
method Scaling limit approach on Gaussian mixture models, including inhomogeneous and extended models.
result Existence of the limit of the Wasserstein metric after renormalization for GMMs with zero variance.
Scalable kernel methods for large datasets using Fourier representations and NUFFT.
problem Cubic complexity in kernel methods limits their use on large-scale datasets.
method Fourier representation of kernels combined with NUFFT for O(n log n) complexity.
result Achieves minimax convergence rates and processes up to tens of billions of samples.
Weak lensing maps contain information beyond two-point statistics on small scales. Much recent work has tried to extract this information through a range of different observables or via nonlinear transformations of the lensing field. Here we train and apply a 2D convolutional neural network to simulated noiseless lensi…
Study finds market inefficiencies vary by time scale, with news uncertainty key.
problem Evaluating scale-dependent informational efficiency of stock markets.
method Tensor-eigenvalue-based Financial Chaos Index, Granger causality, network analysis.
result Semi-strong form of EMH rejected at daily frequency, but not at monthly.
This paper evaluates heterogeneous information fusion using multi-task Gaussian processes in the context of geological resource modeling. Specifically, it empirically demonstrates that information integration across heterogeneous information sources leads to superior estimates of all the quantities being modeled, compa…
Examines predictability and complexity of economic time series using symbolic dynamics and entropy.
problem Understanding the predictability and complexity of economic time series.
method Symbolic dynamics and Information theory (entropy and uncertainty).
result Economic time series are complex and can be expressed in terms of information production.
Price without transaction makes no sense. Trading volume authenticates its corresponding price, so there exist mutual information and correlation between price and trading volume. We are curious about fractal features of this correlation and need to know how structures in different scales translate information. To expl…
Symmetries in shrinking Ricci solitons spread outward.
problem Understanding symmetries in shrinking Ricci solitons.
method Propagating approximate symmetries to larger scales.
result Symmetries in shrinking Ricci solitons spread outward.