The study examines how market completeness is lost when filtering down the information set.
problem Loss of market completeness under filtration shrinkage.
method Bayesian filtering approach to analyze local martingale deflators and their projections.
result Projections of deflators in smaller filtrations are not sufficient to span all local martingale deflators.
Calculates local Granger causality for Gaussian and nonlinear systems.
problem Understanding causal influence in complex systems.
method Vector autoregression and information-theoretic approach.
result Local Granger causality offers a robust and fast method for time-directed information transfer.
There has been a recent interest in understanding the power of local algorithms for optimization and inference problems on sparse graphs. Gamarnik and Sudan (2014) showed that local algorithms are weaker than global algorithms for finding large independent sets in sparse random regular graphs. Montanari (2015) showed t…
Unified approach to characterize and regularize deep neural network local minima.
problem Characterize and improve generalizability of deep neural network local minima.
method Information-theoretic Fisher information metric for local minima characterization and regularization.
result Unified approach successfully characterizes and improves generalizability of DNNs.
Data processing inequalities link Fisher information to local differential privacy constraints.
problem Understanding how Fisher information scales with local differential privacy constraints.
method Developed data processing inequalities for Fisher information under local differential privacy.
result Implications for private estimation with optimal bounds and error rates.
We consider a financial market model with a single risky asset whose price process evolves according to a general jump-diffusion with locally bounded coefficients and where market participants have only access to a partial information flow. For any utility function, we prove that the partial information financial marke…
SDSPCAAN combines supervised and local data structures for better dimensionality reduction.
problem Preserving both global and local data structures for noisy high-dimensional data.
method Supervised discriminative sparse PCA with adaptive neighbors (SDSPCAAN).
result SDSPCAAN improves classification accuracy on high-dimensional datasets.
Proper holomorphic isometries between Bergman domains are biholomorphisms.
problem Characterizing isometries between Bergman domains.
method New method from Information Geometry.
result Proper holomorphic local isometries are biholomorphisms.
Proposes ContSup to boost local learning by supplying context between isolated modules.
problem Local learning's performance degrades with more isolated modules.
method Theoretical analysis and ContSup scheme to supply context between modules.
result Significant performance improvement with minimal overhead.
This paper examines federated learning from an information-theoretic perspective.
problem Understanding the conditions under which averaging model parameters in federated learning is beneficial.
method Measuring mutual information between representations and inputs/labels in local models and comparing it to the averaged model.
result Empirical results confirm the practical usefulness of averaging for neural networks, even with varying local dataset distributions.
Improved GAN performance with a novel local attention mechanism.
problem Enhancing the performance of Generative Adversarial Networks (GANs).
method Introducing a two-dimensional local attention mechanism that preserves geometry and locality, and using information flow graphs for design.
result Significant improvements in FID and Inception scores, from 18.65 to 15.94 on ImageNet.
A new method predicts links better across various networks.
problem Adaptive link prediction for diverse network types.
method MOLI method using local information from neighbors of different distances.
result MOLI outperforms other link prediction algorithms.
This paper proposes an alternative to E2E training for deep networks, reducing memory footprint.
problem High GPUs memory footprint in end-to-end training of deep networks.
method Locally supervised learning with information propagation loss to avoid information collapse.
result The proposed method achieves competitive performance with less than 40% memory footprint compared to E2E training.
Proposes a method to identify causal relationships using background knowledge.
problem Identifying causal relationships in the presence of background knowledge.
method Learning local structure using all types of causal background knowledge (direct, non-ancestral, ancestral). Criteria for identifying causal relationships based on local structure.
result Effective and efficient method for local structure learning and causal relationship identification.
GOLFS selects features for clustering by combining global and local information.
problem Feature selection for high-dimensional clustering without labels.
method Combines global and local information via manifold learning and regularized self-representation.
result Improves feature selection and clustering accuracy.
LSB is a new MCMC method for discrete spaces that reduces target evaluations.
problem Sampling in discrete domains with high efficiency and adaptability.
method Local self-balancing proposals, mutual information objective, self-balancing learning.
result LSB converges with fewer target evaluations compared to existing methods.
A new pricing controller handles resource constraints to infer target prices effectively.
problem Resource constraints prevent fixed-price inference, leading to support exclusion.
method Formalizes support-exclusion failure, designs a target-aware controller, and uses a realized information clock.
result The controller can certify feasible target bands and log continuous local densities, leading to polynomial rates of inference.
New tensor framework connects Fisher information, hypergraphs, and multi-observable correlations.
problem Missing structure in pairwise Fisher graphs for multi-observable radiation patterns.
method Higher-order Fisher tensors and natural exponential-family coordinates.
result Exact triality of Fisher tensors, cumulants, and hypergraphs.
We introduce a method, KL-LIME, for explaining predictions of Bayesian predictive models by projecting the information in the predictive distribution locally to a simpler, interpretable explanation model. The proposed approach combines the recent Local Interpretable Model-agnostic Explanations (LIME) method with ideas …
We study a basic private estimation problem: each of n users draws a single i.i.d. sample from an unknown Gaussian distribution, and the goal is to estimate the mean of this Gaussian distribution while satisfying local differential privacy for each user. Informally, local differential privacy requires that each data …
b-LOAD extends local causal discovery with prior knowledge, improving causal effect estimation.
problem Local causal discovery struggles in data-scarce settings due to uncertainty and incomplete neighborhoods.
method b-LOAD incorporates prior knowledge directly into local structure learning, using Meek's rules to refine discovery.
result b-LOAD refines the admissible equivalence class and enlarges identifiable causal queries, improving causal effect estimation.
Novel approach uses quasi-conformal geometry for OSA classification from cephalometry.
problem Classifying obstructive sleep apnea (OSA) based on craniofacial profiles.
method Quasi-conformal geometry for local deformation analysis of 15 landmark points in lateral cephalograms.
result Proposed model achieves 92.5% testing accuracy.
Biological and artificial neural systems are composed of many local processors, and their capabilities depend upon the transfer function that relates each local processor's outputs to its inputs. This paper uses a recent advance in the foundations of information theory to study the properties of local processors that u…
A framework compares image representations based on local geometry.
problem Comparing image representations based on global structure overlooks local differences.
method Quantify local geometry using Fisher information matrix and optimize differentiation with principal distortions.
result Identifies differences in local sensitivities between models.
Locally private reinforcement learning protects individual environments from reverse engineering.
problem Protecting private information in distributed reinforcement learning environments.
method Locally differentially private algorithms that protect local agents' models from adversarial reverse engineering.
result Demonstrated that the proposed algorithm performs well under local differential privacy (LDP).
CAGES optimizes expensive RL problems by efficiently learning gradients from multiple sources.
problem Optimizing expensive-to-evaluate functions in high-dimensional spaces.
method Cost-Aware Gradient Entropy Search (CAGES) for multi-fidelity Bayesian optimization.
result Significant performance improvements on synthetic and RL benchmark problems.
The paper studies projections of asset prices under equivalent martingale measures.
problem Understanding the impact of information on asset price bubbles and arbitrage opportunities.
method Analyzes optional projections of local martingales into a smaller filtration under equivalent martingale measures.
result Provides general results and specific examples like inverse Bessel process and stochastic volatility models.
Study compares local and global models for hierarchical forecasting accuracy.
problem Challenges in hierarchical time series forecasting, especially in accuracy and information utilisation.
method Developed and evaluated local and global forecasting models (GFMs) to exploit cross-series and cross-hierarchies information.
result Global Forecasting Models (GFMs) outperform local models in hierarchical forecasting accuracy and computational efficiency.
Local graph clustering improves with noisy labels, enhancing accuracy and performance.
problem Local graph clustering with noisy labels for node information.
method Constructing a weighted graph with noisy labels and using diffusion-based clustering.
result Diffusion in the weighted graph yields more accurate recovery of target clusters.
New meta-RL method avoids exploration-exploitation trade-off.
problem Learning to explore and exploit simultaneously in meta-RL.
method Developed new objectives for exploration and exploitation.
result DREAM outperforms existing methods on complex tasks.
Paper finds local normal forms for wavefronts in flat coordinates.
problem Understanding local diffeomorphic types of wavefronts.
method Using connections and the metric, criteria for wavefront types are derived in affine flat coordinates.
result Local normal forms of e/m-wavefronts in affine flat coordinates are derived. Proposes a method for multi-view clustering that considers local structures and feature weights.
problem Challenges in effectively exploiting complementary information across multiple views.
method Simultaneously assigns weights to different features and captures local information in view-specific feature spaces.
result Achieves state-of-the-art performance on benchmark datasets.
In this paper we investigate the local risk-minimization approach for a semimartingale financial market where there are restrictions on the available information to agents who can observe at least the asset prices. We characterize the optimal strategy in terms of suitable decompositions of a given contingent claim, wit…
In a physical neural system, where storage and processing are intimately intertwined, the rules for adjusting the synaptic weights can only depend on variables that are available locally, such as the activity of the pre- and post-synaptic neurons, resulting in local learning rules. A systematic framework for studying t…
A method to visualize multidimensional local subspaces using implicit differentiation.
problem Understanding the effect of multidimensional projection on local subspaces.
method Implicit function differentiation to analyze local subspaces shaped by multidimensional ellipses.
result Visualization of local subspaces provides insights into the global structure of data.
Uncertainty principles such as Heisenberg's provide limits on the time-frequency concentration of a signal, and constitute an important theoretical tool for designing and evaluating linear signal transforms. Generalizations of such principles to the graph setting can inform dictionary design for graph signals, lead to …
Corrects an earlier theorem, establishing new facts about information structures and non-anticipative aggregation.
problem The nature of information structures and their impact on non-anticipative aggregation.
method Local reduction of pricing to the natural price filtration, stability properties, and the establishment of new facts.
result Non-anticipative signals can reveal future information, requiring dependence among signals (masking relation) and not independence.
Combining global and local explanations improves user understanding of RL agents.
problem Challenges in explaining agent behavior due to large state spaces and delayed rewards.
method Integrating strategy summaries with saliency maps to provide both global and local explanations.
result Summaries including important states significantly improve user understanding of RL agents.
In the present work we address the problem of evaluating the historical performance of a trading strategy or a certain portfolio of assets. Common indicators such as the Sharpe ratio and the risk adjusted return have significant drawbacks. In particular, they are global indices, that is they do not preserve any 'local'…
Paper resolves decades-old problem about L-spectra.
problem Identifying L-spectra local information with geometric data. method Proved equivalence of L-orientations and characteristic classes. result Levitt-Ranicki's theory equivalent to Brumfiel-Morgan's classes.
DNNs improve localization from channel estimates, overcoming practical impairments.
problem Improving localization accuracy from channel estimates in Massive MIMO systems.
method Principled feature design for DNNs invariant to practical impairments.
result DNN achieves high localization accuracy and generalization capability.
In this paper we investigate the local risk-minimization approach for a combined financial-insurance model where there are restrictions on the information available to the insurance company. In particular we assume that, at any time, the insurance company may observe the number of deaths from a specific portfolio of in…
New methods identify local clusters in graphs with few labels.
problem Identifying specific substructures in large graphs without additional structural information.
method Random sampling, diffusion, and overlap analysis of local clusters.
result Proves the correctness of the proposed methods and achieves state-of-the-art results.
We discuss how minimal financial market models can be constructed by bridging the gap between two existing, but incomplete, market models: a model in which a population of virtual traders make decisions based on common global information but lack local information from their social network, and a model in which the tra…
In plant and animal breeding studies a distinction is made between the genetic value (additive + epistatic genetic effects) and the breeding value (additive genetic effects) of an individual since it is expected that some of the epistatic genetic effects will be lost due to recombination. In this paper, we argue that t…
Enhances graph neural networks with spectral and topological information.
problem Improving graph neural networks' expressivity beyond Weisfeiler-Leman hierarchy.
method Integrates spectral information into Persistent Homology diagrams.
result SpectRe is strictly more expressive than PH and spectral information alone.
Local surrogate explainers vary in objectives, leading to incomparable explanations.
problem Variability in objectives among local surrogate explainers.
method Review of multiple local surrogate explainers, focusing on extracted information.
result Diverse explanations from similar methods due to differing objectives.
In probabilistic approaches to classification and information extraction, one typically builds a statistical model of words under the assumption that future data will exhibit the same regularities as the training data. In many data sets, however, there are scope-limited features whose predictive power is only applicabl…