Research
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

18.8%37.5%56.3%75.0% · Jul 199319922001200920172026
48 results for imperceptible pattern embedding

Simple attack bypasses state-of-the-art DNN watermarking.

problem Protecting DNN models from watermark removal attacks.
method Combining imperceptible pattern embedding and spatial-level transformations for a simple yet effective watermark removal.
result Our attack bypasses state-of-the-art watermarking solutions with high success rates.

Security of machine learning models is a concern as they may face adversarial attacks for unwarranted advantageous decisions. While research on the topic has mainly been focusing on the image domain, numerous industrial applications, in particular in finance, rely on standard tabular data. In this paper, we discuss the…

2019-11-08abs ↗pdf ↗

We establish a correspondence between the dimer model on a bipartite graph and a circle pattern with the combinatorics of that graph, which holds for graphs that are either planar or embedded on the torus. The set of positive face weights on the graph gives a set of global coordinates on the space of circle patterns wi…

2018-10-12abs ↗pdf ↗

Adversarial attacks aim to confound machine learning systems, while remaining virtually imperceptible to humans. Attacks on image classification systems are typically gauged in terms of pp-norm distortions in the pixel feature space. We perform a behavioral study, demonstrating that the pixel pp-norm for any $0\le p …

2019-06-06abs ↗pdf ↗

This work improves KG embeddings by integrating hyperbolic and attention mechanisms.

problem Preserving hierarchical and logical patterns in KGs with low-dimensional embeddings.
method Combines hyperbolic reflections/rotations with attention mechanisms to capture complex relational patterns.
result Improves MRR by up to 6.1% on standard benchmarks and new state-of-the-art results in high dimensions.

In this paper, we propose a new feature extraction technique for program execution logs. First, we automatically extract complex patterns from a program's behavior graph. Then, we embed these patterns into a continuous space by training an autoencoder. We evaluate the proposed features on a real-world malicious softwar…

2018-04-10abs ↗pdf ↗

Study circle patterns on tori, linking symplectic forms and homeomorphisms.

problem Understanding circle patterns on tori and their symplectic properties.
method Investigates the space of circle patterns on closed tori with complex projective structures, embedding it into Teichmüller spaces and analyzing symplectic forms.
result Non-degeneracy of the pulled-back Weil-Petersson symplectic form and homeomorphism between circle patterns and Teichmüller spaces.

Method analyzes large-scale network data to detect communication pattern shifts.

problem Analyzing large-scale time-series network data is challenging.
method Temporal encoder embedding method using ground-truth or estimated vertex labels.
result Detects communication pattern shifts across all levels of network structure.

This paper proposes grid cells encode position via a conformal isometric embedding of 2D physical space.

problem Hexagonal grid firing patterns in grid cells.
method Learning a distance-preserving position embedding in neural space using a recurrent neural network.
result The conformal isometric embedding of 2D physical space into neural space explains hexagonal grid firing patterns.

It has been demonstrated that adversarial graphs, i.e., graphs with imperceptible perturbations added, can cause deep graph models to fail on node/graph classification tasks. In this paper, we extend adversarial graphs to the problem of community detection which is much more difficult. We focus on black-box attack and …

2020-01-22abs ↗pdf ↗

Paper proposes privacy-preserving learning for images, making them imperceptible to humans but recognizable by machines.

problem Conflict between developing AI systems and protecting sensitive training data.
method Encryption strategies (random shuffling and sub-patch mixing) followed by minimal adaptation to vision transformer.
result Achieves comparable accuracy to competitive methods while ensuring human-imperceptibility of encrypted images.

New method makes neural networks more resilient to location-optimized adversarial patches.

problem Neural networks' vulnerability to adversarial patches that are visible but still effective.
method Developed a practical approach to optimize patch locations and applied adversarial training.
result Significantly improved robustness against adversarial patches on CIFAR10 and GTSRB.

Calendar graph neural networks model user behavior with location and time data.

problem Modeling user behavior with location and time information for demographic prediction.
method Graph neural networks with a tripartite network of items, sessions, and locations, and a hierarchical calendar network.
result User embeddings preserve spatial and temporal patterns of various periodicity.

LLE produces unwanted results without regularization, which can be prevented with regularization.

problem LLE's inherent unwanted results without regularization.
method Mathematical proof and numerical examples of regularization effectiveness.
result Regularization prevents unwanted results in LLE.

Localized uncertainty attacks target uncertain regions to create imperceptible adversarial examples.

problem Adversarial examples that are imperceptible to humans and strong under deterministic classifiers.
method Localized uncertainty attacks by perturbing uncertain regions, using predictive uncertainty or surrogate models.
result Localized uncertainty attacks produce strong adversarial examples that retain input similarity.

While deep learning is remarkably successful on perceptual tasks, it was also shown to be vulnerable to adversarial perturbations of the input. These perturbations denote noise added to the input that was generated specifically to fool the system while being quasi-imperceptible for humans. More severely, there even exi…

2017-04-19abs ↗pdf ↗

We present a novel view of nonlinear manifold learning using derivative-free optimization techniques. Specifically, we propose an extension of the classical multi-dimensional scaling (MDS) method, where instead of performing gradient descent, we sample and evaluate possible "moves" in a sphere of fixed radius for each …

2018-06-01abs ↗pdf ↗

Relational data mining is becoming ubiquitous in many fields of study. It offers insights into behaviour of complex, real-world systems which cannot be modeled directly using propositional learning. We propose Symbolic Graph Embedding (SGE), an algorithm aimed to learn symbolic node representations. Built on the ideas …

2019-10-29abs ↗pdf ↗

We propose the Relational Tucker3 (RT) decomposition for multi-relational link prediction in knowledge graphs. We show that many existing knowledge graph embedding models are special cases of the RT decomposition with certain predefined sparsity patterns in its components. In contrast to these prior models, RT decouple…

2019-02-03abs ↗pdf ↗

Network embedding leverages the node proximity manifested to learn a low-dimensional node vector representation for each node in the network. The learned embeddings could advance various learning tasks such as node classification, network clustering, and link prediction. Most, if not all, of the existing works, are ove…

2017-06-06abs ↗pdf ↗

Topic modeling analyzes documents to learn meaningful patterns of words. For documents collected in sequence, dynamic topic models capture how these patterns vary over time. We develop the dynamic embedded topic model (D-ETM), a generative model of documents that combines dynamic latent Dirichlet allocation (D-LDA) and…

2019-07-12abs ↗pdf ↗

Deep neural networks (DNN) trained in a supervised way suffer from two known problems. First, the minima of the objective function used in learning correspond to data points (also known as rubbish examples or fooling images) that lack semantic similarity with the training data. Second, a clean input can be changed by a…

2017-01-04abs ↗pdf ↗

The paper explores how sinks and diagonal patterns prevent attention oversmoothing.

problem Preventing attention oversmoothing in neural networks.
method Analyzing geometric conditions and conditions for dense vs. sparse attention, proving equivalence between sinks and hard attention switch, and comparing the costs of sinks vs. diagonal patterns.
result Sinks and diagonal patterns effectively prevent attention oversmoothing, and diagonal patterns provide a more flexible approach.

Adversarial examples are a pervasive phenomenon of machine learning models where seemingly imperceptible perturbations to the input lead to misclassifications for otherwise statistically accurate models. We propose a geometric framework, drawing on tools from the manifold reconstruction literature, to analyze the high-…

2018-11-01abs ↗pdf ↗

Deep neural networks have frequently been used to directly learn representations useful for a given task from raw input data. In terms of overall performance metrics, machine learning solutions employing deep representations frequently have been reported to greatly outperform those using hand-crafted feature representa…

2019-04-15abs ↗pdf ↗

Word embeddings are a powerful approach for unsupervised analysis of language. Recently, Rudolph et al. (2016) developed exponential family embeddings, which cast word embeddings in a probabilistic framework. Here, we develop dynamic embeddings, building on exponential family embeddings to capture how the meanings of w…

2017-03-23abs ↗pdf ↗

GUIDE-VAE generates user-guided data with improved realism and performance.

problem Generating data points for multi-user datasets while considering user information.
method Conditional generative model that integrates user embeddings and a pattern dictionary-based covariance composition.
result GUIDE-VAE outperforms conventional VAEs in multi-user settings, especially under data imbalance.

MEANTIME improves sequential recommendation by using multi-temporal embeddings and attention mechanisms.

problem Limited use of timestamp information and information bottleneck in sequential recommendation models.
method MEANTIME employs multiple types of temporal embeddings and attention mechanisms to capture diverse patterns from user behavior sequences.
result MEANTIME outperforms state-of-the-art sequential recommendation methods.