Federated learning algorithm reduces global model size by combining local and global representations.
problem Scalability issues in training large models on private data distributed over multiple devices.
method Proposes a federated learning algorithm that jointly learns compact local representations and a global model.
result The global model can be smaller since it only operates on local representations, reducing the number of communicated parameters.
Combines global and local features for better social circle prediction in ego-networks.
problem Efficiently analyzing ego-networks with hidden local structures.
method Evolved deep learning techniques to capture both global and local network features.
result Social circle prediction benefits from a combination of global and local features.
Global fixed points in low-dimensional surface group space correspond to trivial representations.
problem Understanding global fixed points in surface group deformation spaces.
method Direct analysis of the deformation space, focusing on the trivial representation.
result Global fixed points in low-dimensional surface group deformation spaces correspond to the trivial representation of the pure mapping class group.
This study compares global vs local observation and action representations for DRL in RTS games.
problem Improving Deep Reinforcement Learning performance in RTS games.
method Comparing two observation and action representations in μRTS.
result Local representation outperforms global representation in resource harvesting tasks.
iREPA shows spatial structure, not global semantic, drives generation performance in REPA.
problem Understanding what aspect of the target representation matters for generation.
method Empirical analysis of 27 vision encoders, two modifications to REPA.
result Spatial structure, not global semantic, drives generation performance.
Hidden symmetry of a G'-space X is defined by an extension of the G'-action on X to that of a group G containing G' as a subgroup. In this setting, we study the relationship between the three objects: (A) global analysis on X by using representations of G (hidden symmetry); (B) global analysis on X by using representat…
Learning interpretable representations of data remains a central challenge in deep learning. When training a deep generative model, the observed data are often associated with certain categorical labels, and, in parallel with learning to regenerate data and simulate new data, learning an interpretable representation of…
A new model decouples global and local image representations without supervision.
problem Learning decoupled global and local image representations without supervision.
method Variational auto-encoding framework with invertible generative flow.
result The model effectively learns decoupled representations of images.
This paper improves a local-to-global principle for Morse quasigeodesics.
problem Quantify the size of local neighborhoods for global Morse behavior.
method Estimates in symmetric space to supplement Kapovich-Leeb-Porti's proof.
result Explicit criteria for local-to-global principle verified.
Proposes a novel model for healthcare and SME credit risk prediction.
problem Lack of guidance from global view in sequence representation learning for time series modeling.
method Hierarchical Global View-guided (HGV) sequence representation learning framework with GGE and β-Attn modules. result Competitive prediction performance compared with other known baselines.
This paper learns graph node representations using global context prediction.
problem Efficiently learning useful node representations from unlabeled graph data.
method Randomly selects node pairs, trains a neural net to predict contextual positions.
result Our approach outperforms many unsupervised methods and sometimes supervised ones.
New method identifies differences between groups in low-dimensional data representations.
problem Identifying meaningful differences between groups in low-dimensional data representations.
method Introduce Global Counterfactual Explanation (GCE) and Transitive Global Translations (TGT) for computing GCEs.
result TGT identifies sparse, accurate explanations that match real data patterns.
Paper finds exact global optima for adversarial representation learning.
problem Obtaining data representations invariant to sensitive attributes.
method Spectral learning for linear functions, kernel representation for non-linear functions.
result Exact closed-form expression for global optima with performance guarantees.
GAMLA learns manifold structures with auto-encoding for global insights.
problem Limited global insight and lack of interpretable analytical descriptions in manifold learning.
method Two-round auto-encoding process to derive character and complementary representations.
result GAMLA provides global and analytical descriptions of smooth manifolds.
Representation learning seeks to expose certain aspects of observed data in a learned representation that's amenable to downstream tasks like classification. For instance, a good representation for 2D images might be one that describes only global structure and discards information about detailed texture. In this paper…
Transformer autoencoder learns musical style from performances.
problem Learning high-level controls over symbolic music generation.
method Aggregates encodings of input data across time to obtain global style representation.
result Improves control over performance style and melody in music generation tasks.
A new deep generative model captures global dependencies without supervision.
problem Global modeling in deep generative models.
method Non-i.i.d. variational autoencoders with mixture model and global Gaussian latent variable.
result Captures interpretable disentangled representations and domain alignment.
MeLa learns task relations by inferring global labels for robust FSL.
problem Few-shot learning with limited global labels.
method Meta Label Learning (MeLa) and augmented pre-training.
result MeLa outperforms existing methods across diverse benchmarks.
Multiview representation learning is very popular for latent factor analysis. It naturally arises in many data analysis, machine learning, and information retrieval applications to model dependent structures among multiple data sources. For computational convenience, existing approaches usually formulate the multiview …
Proposes a tool to contrast global vs personalized models in clinical prediction.
problem Balancing global vs personalized models in clinical prediction.
method Localized regression approach using autoencoder for dimension reduction.
result Identification of patient subgroups where global models fall short.
Paper proposes G-CRD to improve GNNs by preserving global graph topology.
problem Improving lightweight GNNs for robust performance on large-scale real-world graphs.
method Introduces Graph Contrastive Representation Distillation (G-CRD) using contrastive learning.
result G-CRD consistently boosts GNN performance and robustness, outperforming existing methods.
Generalizes global hyperbolicity to higher signatures and proves compactness.
problem Global hyperbolicity in higher pseudo-Riemannian signatures.
method Generalization and proof of compactness of causal diamonds.
result Existence of solutions to a Plateau problem and characterization of holonomies.
Compared with global average pooling in existing deep convolutional neural networks (CNNs), global covariance pooling can capture richer statistics of deep features, having potential for improving representation and generalization abilities of deep CNNs. However, integration of global covariance pooling into deep CNNs …
Improved VAE representations lead to better image classification.
problem VAE representations are inferior to non-latent models for image classification.
method Used a decoder that prefers local features, improving global feature capture in latent variables.
result Significant improvement in downstream semantic classification tasks.
This paper studies nonlinear representation learning dynamics beyond the NTK regime.
problem Efficient reasoning and inference in raw sensory data representations.
method Identifies common model structure assumption and data-architecture alignment condition for global convergence and optimality.
result Theoretical framework explains network size effects and provides practical model structure guidelines.
Researchers use Mellin-Barnes integrals to study trinomial equations and their braids.
problem Analyzing the roots of trinomial algebraic equations.
method Global analytic continuation and Mellin-Barnes integral representations.
result Precise description of the Galois group of trinomial equations.
Explains how group representations behave under subgroup restrictions.
problem Behavior of irreducible representations when restricted to subgroups.
method Expository account of new directions in representation theory.
result Highlights recent advances in branching problems for real reductive groups.
Global analysis of Dixmier traces and Wodzicki residues on compact Lie groups.
problem Computing Dixmier traces and Wodzicki residues on compact Lie groups.
method Global quantisation approach, using global symbols and representation theory.
result Explicit formulae for Dixmier traces and Wodzicki residues on compact Lie groups.
Estimates neural representation dimensionality from small sample sizes.
problem Estimating neural representation dimensionality from limited data.
method Proposed a bias-corrected estimator for participation ratio of eigenvalues.
result The estimator is more accurate with finite samples and noise.
LDReg addresses local dimensional collapse in self-supervised learning.
problem Local dimensional collapse in self-supervised learning representations.
method Local dimensionality regularization based on Fisher-Rao metric.
result LDReg improves representation quality and regularizes local and global dimensions.
Anosov representations are linked to specific spacetimes.
problem Understanding representations of groups into Lie groups.
method Holonomy of Anosov representations into O0(2, n) and spatial compactness of spacetimes.
result Anosov representations are the holonomy of CGHM conformally flat spacetimes.
Proposes a wave-constrained matrix factorization for signal learning.
problem Learning signals constrained by the wave equation.
method Wave-informed matrix factorization with global optimality guarantees.
result Proves global optimality of the proposed model in polynomial time.
We show that one can lift locally real analytic curves from the orbit space of a compact Lie group representation, and that one can lift smooth curves even globally, but under an assumption.
Meta-GLAR combines global deep representations with local adaptation for improved forecasting accuracy.
problem Joint learning from related time series boosts accuracy but fails for out-of-sample forecasting.
method Meta-GLAR uses a meta-learning approach to adapt RNN representations for each time series.
result Meta-GLAR outperforms state-of-the-art methods in out-of-sample forecasting accuracy.
New method learns high-quality Laplacian representations for reinforcement learning.
problem Lack of accurate Laplacian representations in large or continuous state spaces.
method Reformulated spectral graph drawing objective to have eigenvectors as unique global minimizer.
result Learned Laplacian representations more faithfully approximate the ground truth.
Global watermark for diffusion language models decouples detection from local contexts.
problem Watermarking in diffusion language models is challenging due to joint sampling of distributions over many unresolved positions.
method Proposes a global vector-valued sketch representation to control watermarking in masked diffusion language models.
result The method decouples detection from local contexts, resulting in an order-agnostic statistic and robustness.
Domain adaptation aims to exploit the knowledge in source domain to promote the learning tasks in target domain, which plays a critical role in real-world applications. Recently, lots of deep learning approaches based on autoencoders have achieved a significance performance in domain adaptation. However, most existing …
In this work, we introduce the Global Planar Convolution module as a building-block for fully-convolutional networks that aggregates global information and, therefore, enhances the context perception capabilities of segmentation networks in the context of brain tumor segmentation. We implement two baseline architecture…
The paper studies how neural networks evolve representations, finding a unique fixed point for nonlinear activations.
problem Understanding how neural networks transform input data across layers.
method Theoretical framework for the evolution of the kernel sequence, using mean-field regime and Hermite polynomials.
result For nonlinear activations, the kernel sequence converges globally to a unique fixed point.
It is common for CCTV operators to overlook inter- esting events taking place within the crowd due to large number of people in the crowded scene (i.e. marathon, rally). Thus, there is a dire need to automate the detection of salient crowd regions acquiring immediate attention for a more effective and proactive surveil…
In this study, a novel feature coding method that exploits invariance for transformations represented by a finite group of orthogonal matrices is proposed. We prove that the group-invariant feature vector contains sufficient discriminative information when learning a linear classifier using convex loss minimization. Ba…
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.
We prove a Milnor-Wood inequality for representations of the fundamental group of a compact complex hyperbolic manifold in the group of isometries of quaternionic hyperbolic space. Of special interest is the case of equality, and its application to rigidity. We show that equality can only be achieved for totally geodes…
Diffusion MRI (dMRI) provides the ability to reconstruct neuronal fibers in the brain, in vivo, by measuring water diffusion along angular gradient directions in q-space. High angular resolution diffusion imaging (HARDI) can produce better estimates of fiber orientation than the popularly used diffusion tens…
Let Γ be a finitely generated group, and let $\op{Rep}(Γ, \SO(2,n))$ be the moduli space of representations of Γ into $\SO(2,n)$ (n≥2). An element $ρ: Γ\to \SO(2,n)$ of $\op{Rep}(Γ, \SO(2,n))$ is \textit{quasi-Fuchsian} if it is faithful, discrete, preserves an acausal subset in the conformal boundary $\Ein_…
Proof confirms perfect representation in deep learning models.
problem Tackles the perfect Platonic Representation Hypothesis in deep learning models.
method Detailed proof using stochastic gradient descent (SGD) and analysis of global minima.
result SGD trains EDLNs to learn the same representation up to rotation, suggesting emergent entropic forces.
Local nonparametric meta-learning improves meta-generalization across tasks.
problem Meta-learning struggles with global inductive biases and out-of-distribution tasks.
method Proposes a local, nonparametric meta-learning algorithm using meta-trained local learning rules.
result Improved meta-generalization and state-of-the-art results in robotics benchmarks.
We present a global representation for surfaces in 3-dimensional hyperbolic space with constant mean curvature 1 (CMC-1 surfaces) in terms of holomorphic spinors. This is a modification of Bryant's representation. It is used to derive explicit formulas in hypergeometric functions for CMC-1 surfaces of genus 0 with thre…