Neighbor-encoder learns representations by reconstructing neighbors, outperforming autoencoders.
problem Learning effective representations for various data types.
method Reconstructs neighbors instead of inputs, incorporating domain knowledge through similarity definitions.
result Neighbor-encoder outperforms autoencoders in diverse domains and tasks.
HNE enhances manifold learning by combining neighbors hierarchically.
problem Data sparsity in manifold learning.
method Hierarchic Neighbors Embedding (HNE) combines neighbors hierarchically to improve local connections.
result HNE performs well on synthetic and real-world data, especially in sparse and weakly connected scenarios.
Method reconstructs missing wind farm data using graph theory and nearest neighbors.
problem Missing data in wind farm records due to sensor failures.
method Combines spectral graph theory and k-Nearest Neighbors to estimate missing data.
result Significant improvement in data reconstruction over existing methods.
New algorithm reconstructs sparse networks in subquadratic time.
problem Reconstructing sparse networks from limited data.
method Stochastic second neighbor search to bypass quadratic complexity.
result Subquadratic time complexity, up to O(N3/2logN). SNJ recovers latent tree models from similarity matrices.
problem Reconstructing latent tree models from observed data.
method Spectral Neighbor Joining (SNJ) method.
result SNJ is consistent and requires fewer samples for accurate tree recovery.
Algorithm reconstructs vertex positions in random geometric graphs with improved accuracy.
problem Reconstructing vertex positions in random geometric graphs with high accuracy.
method Hybrid of graph distances and short-range estimates based on common neighbors.
result Algorithm reconstructs vertex positions with error of O(nβ), improving over previous results. In many scientific disciplines structures in high-dimensional data have to be found, e.g., in stellar spectra, in genome data, or in face recognition tasks. In this work we present a novel approach to non-linear dimensionality reduction. It is based on fitting K-nearest neighbor regression to the unsupervised regressio…
End-to-end deep metric learning tackles multi-label image classification.
problem Multi-label image classification problem.
method Two-way deep distance metric learning in a latent space with a reconstruction module.
result Our method outperforms state-of-the-arts on publicly available image datasets.
The local linear embedding algorithm (LLE) is a non-linear dimension-reducing technique, widely used due to its computational simplicity and intuitive approach. LLE first linearly reconstructs each input point from its nearest neighbors and then preserves these neighborhood relations in the low-dimensional embedding. W…
Model disentangles font content and style.
problem Analyzing and reconstructing fonts.
method Variational inference and asymmetric transpose convolutional process.
result Model outperforms state-of-the-art models in font reconstruction.
Paper proposes RAN for better anomaly detection in time series data.
problem Anomaly detection algorithms often fail to accurately detect anomalies due to incomplete reconstruction of anomaly data.
method RAN uses adversarial learning and latent vector-constrained Autoencoder to ensure consistent reconstruction of anomaly data.
result RAN outperforms other algorithms in detecting meaningful anomalies with higher AUC-ROC scores.
k Nearest Neighbors (kNN) is one of the most widely used supervised learning algorithms to classify Gaussian distributed data, but it does not achieve good results when it is applied to nonlinear manifold distributed data, especially when a very limited amount of labeled samples are available. In this paper, we pro…
Paper shows simple losses are effective at image reconstruction and detects overfitting in deep generators.
problem Detecting overfitting in deep generative networks, especially GANs.
method Simple losses for image reconstruction, analysis of reconstruction errors, comparison of GAN models.
result Overfitting is not detectable in pure GAN models but is in hybrid adversarial models.
Generative adversarial network improves audio inpainting for long gaps.
problem Generating missing audio content in long-range gaps using WGAN.
method Proposed WGAN architecture with short-range and long-range neighboring borders.
result The proposed model outperforms classical WGAN in reconstructing high-frequency content.
The Rips complex at scale r is homotopy equivalent to the nerve of a cover of diameter r.
problem Reconstructing spaces using Rips complexes and covers.
method Functorial Dowker-Nerve Diagram, homotopy equivalence, cover of diameter r.
result General framework for reconstructing spaces by Rips complexes.
Graph attention auto-encoder reconstructs graph structure and attributes.
problem Lack of methods to reconstruct graph structure and node attributes in graph auto-encoders.
method Stacked encoder/decoder layers with self-attention mechanisms, regularized node representations to reconstruct graph structure.
result Competitive performance on node classification benchmarks, including inductive learning.
CASTLE learns causal DAG to improve model generalization.
problem Improving model generalization to out-of-sample data.
method CASTLE learns causal relationships via adjacency matrix embedded in neural network input layers, reconstructing only causal features.
result CASTLE leads to better out-of-sample predictions compared to other regularizers.
GUIDE detects anomalies in attributed networks by reconstructing node attributes and higher-order structures.
problem Lack of effective mechanisms for detecting anomalies in complex network interactions.
method GUIDE uses attribute and structure autoencoders, graph attention, and reconstruction errors to identify anomalies.
result GUIDE significantly outperforms state-of-the-art methods on multiple real-world datasets.
Paper proposes WGAIN for missing feature reconstruction.
problem Missing data in datasets.
method Wasserstein Generative Adversarial Imputation Network (WGAIN) compared to traditional methods.
result WGAIN outperforms traditional methods in imputing missing data.
We introduce a novel approach for predicting the progression of adolescent idiopathic scoliosis from 3D spine models reconstructed from biplanar X-ray images. Recent progress in machine learning have allowed to improve classification and prognosis rates, but lack a probabilistic framework to measure uncertainty in the …
Our goal is to extract meaningful transformations from raw images, such as varying the thickness of lines in handwriting or the lighting in a portrait. We propose an unsupervised approach to learn such transformations by attempting to reconstruct an image from a linear combination of transformations of its nearest neig…
Geometric analysis reveals how adversarial examples arise from model boundaries.
problem Adversarial examples cause misclassifications in machine learning models.
method Geometric framework using manifold reconstruction tools.
result Adversarial examples are a consequence of model boundaries on low-dimensional data manifolds.
Bayesian ptychography method reduces overlap for faster imaging.
problem Reduced overlap leads to large data volumes and long acquisition times.
method Generative model combined with MCMC for posterior sampling.
result Framework consistently outperforms iterative reconstruction methods with reduced overlap.
VAEs can generate novel examples but performance varies with latent space dimensionality.
problem Can VAEs generate novel examples not seen in training data?
method Investigated VAEs on MNIST dataset, varying latent space dimensions.
result Higher-dimensional latent spaces lead to better nearest-neighbor approximations, but lower dimensions offer an advantage for unseen classes.
New results on inferring hidden states in trackable weak models.
problem Inferring hidden states in trackable weak models.
method Analyzing strongly-connected trackable weak models and reconstructing branch choices.
result The number of hypotheses in strongly-connected trackable models is bounded by a constant.
New model addresses instability in hierarchical clustering of social networks.
problem Instability in existing hierarchical clustering algorithms for social networks.
method Introduce T-Stochastic Graphs, a probabilistic model that relaxes ultrametric assumptions. result Prove spectral approach combining Neighbor-Joining is statistically consistent.
The paper analyzes how noise affects distances in high-dimensional data and when they remain useful.
problem Noise corrupts distances in high-dimensional data, making them unreliable for identifying true nearest and farthest neighbors.
method The paper uses asymptotic probabilistic expressions to characterize noise effects and decomposes data into ground truth and noise components.
result Under certain conditions, empirical neighborhood relations remain truthful even when distance concentration occurs.
Generative model learns compact codes for video recovery.
problem Efficiently represent and reconstruct videos from missing data.
method Generative network trained to map compact latent codes to images, with low-rank and similarity constraints.
result Can recover true video sequences even if not in pretrained network's range.
Improved satellite object detection with NN upscaling.
problem Improving object detection accuracy on small objects in satellite images.
method Comparison of Super-Resolution (SR) and Nearest Neighbors (NN) interpolation on xView satellite data.
result NN upscaling yields nearly identical object detection results to SR with a 0.0002 AP difference.
New methods improve feature extraction and representation quality in supervised and unsupervised DR.
problem Statistical dependence, data diversity, contrast, and interpretability in conventional DR methods.
method Combines linear and nonlinear formulations for three new independence criteria.
result Significant improvements in contrast, accuracy, and interpretability over baselines.
Researchers analyze the geometric and statistical properties of transformer model representations.
problem Understanding the semantic structure of large transformer models across various data types.
method Characterization of geometric and statistical properties through analysis of intrinsic dimension and neighbor composition.
result The semantic information of the dataset is better expressed at the end of the first peak in transformer models.
LNPE enhances local connections in embeddings using extended neighbor propagation.
problem Improving local connections and interactions in nonlinear dimensionality reduction.
method Inspired by GCN, LNPE extends 1-hop neighbors to n-hop neighbors in LLE.
result LNPE produces more faithful and robust embeddings with better topological and geometrical properties.
AnomalyDAE detects anomalies in networks by learning cross-modality interactions.
problem Detecting anomalies in attributed networks where structure and attributes interact.
method Dual autoencoder framework with attention mechanism for joint learning of structure and attribute embeddings.
result AnomalyDAE effectively detects anomalies by reconstructing node attributes and structures.
Study nearest-neighbor radii under dependent sampling, finding they remain informative.
problem Analyzing nearest-neighbor radii under dependent sampling.
method Consider strong mixing dependent observations, establish distribution-free almost sure convergence and sharp non-asymptotic moment bounds.
result Nearest-neighbor geometry remains informative under dependence sampling.
Deep nearest neighbors outperform self-supervised methods in anomaly detection.
problem Anomaly detection using self-supervised deep methods.
method Simple nearest-neighbor approach on Imagenet pretrained features.
result Nearest-neighbor method outperforms self-supervised methods in accuracy, few shot generalization, training time, and noise robustness.
Dictionary learning algorithms have been successfully used in both reconstructive and discriminative tasks, where the input signal is represented by a linear combination of a few dictionary atoms. While these methods are usually developed under ℓ1 sparsity constrain (prior) in the input domain, recent studies hav…
Characterizes Lebesgue points using nearest neighbor methods.
problem Consistency of classification algorithms based on nearest neighbors.
method Characterization of Lebesgue points via 1-Nearest Neighbor regression.
result Proves convergence of 1-Nearest Neighbor classification algorithms in metric spaces.
A deep neural network for spatial time series forecasting.
problem Challenges in forecasting spatial time series with specific patterns and curse of dimensionality.
method Spatial-temporal decomposition, fuzzy clustering, multi-kernel convolution, convolution-LSTM, denoising autoencoder.
result Model outperforms baseline and state-of-the-art models in traffic flow prediction.
TPA-AD detects axle-box bearing anomalies using pseudo anomalies near normal boundaries.
problem Detecting axle-box bearing anomalies with only normal training data.
method Two-stage approach: pseudo anomalies, contrastive learning, KNN.
result Improves anomaly detection separability and sensitivity to degradation.
The paper explains how nearest neighbor methods succeed in prediction.
problem Explaining the success of nearest neighbor methods in prediction.
method The paper covers both theoretical and practical aspects of nearest neighbor methods, including statistical guarantees and practical algorithms.
result The paper provides nonasymptotic statistical guarantees and practical algorithms for nearest neighbor methods.
AWNN improves matrix completion by adaptively weighting nearest neighbors.
problem Matrix completion with optimal nearest neighbor weights and radii selection.
method Adaptively weighted nearest neighbor method for matrix completion.
result Theoretical guarantees and synthetic experiments support the effectiveness of AWNN.
A new method uses nearest neighbors for importance weighting.
problem Data covariate shift problems in machine learning.
method Nearest neighbor classification scheme for determining importance weights.
result Demonstrated effectiveness through comparative experiments on various classification tasks.
Adaptive algorithm speeds up k-nearest-neighbor searches.
problem Finding k nearest neighbors with varying efficiency.
method Adaptive estimation of distances to optimize search.
result The algorithm achieves significant speedups compared to naive methods.
This paper compares FAISS and FENSHSES for nearest neighbor search in Hamming space.
problem Comparing nearest neighbor search systems in Hamming space.
method Comprehensive evaluations of indexing speed, search latency, and RAM consumption.
result Better understanding of trade-offs between main memory and secondary memory systems.
Efficiently find approximate nearest neighbors in high dimensions.
problem Finding the closest point in a high-dimensional dataset.
method Develops efficient data structures for approximate nearest neighbor search.
result Efficient solutions for approximate nearest neighbor problem.
Nearest neighbor methods are a popular class of nonparametric estimators with several desirable properties, such as adaptivity to different distance scales in different regions of space. Prior work on convergence rates for nearest neighbor classification has not fully reflected these subtle properties. We analyze the b…
A significant challenge to make learning techniques more suitable for general purpose use is to move beyond i) complete supervision, ii) low dimensional data, iii) a single task and single view per instance. Solving these challenges allows working with "Big Data" problems that are typically high dimensional with multip…
Paper defends against adversarial videos by detecting and reducing imperceptible perturbations.
problem Adversarial videos can fool well-trained video classification models.
method Temporal consistency between frames and spatial denoising to detect and reduce perturbations.
result The proposed method significantly improves robustness against adversarial attacks.