We define invariants of unoriented knots and links by enhancing the integral kei counting invariant Phi_X^Z (K) for a finite kei X using representations of the kei algebra, Z_K[X], a quotient of the quandle algebra Z[X] defined by Andruskiewitsch and Grana. We give an example that demonstrates that the enhanced invaria…
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.
169,051 papers · 148 categories
Trend · papers per month
48 results for “kei”
Arithmetic Kei Theorymath.NT
New invariant for square-free integers derived from kei theory.
problem Developing numerical invariants for square-free integers.
method Defining a kei for each square-free integer and calculating a coloring invariant.
result Conjecture and proof of asymptotic average order for coloring invariant.
Paper proposes protecting DNN models with secret key preprocessing.
problem Protecting deep learning models from unauthorized access.
method Block-wise pixel shuffling with secret key for preprocessing.
result Protected models maintain close performance to non-protected models with correct key, but accuracy drops significantly with incorrect key.
A new bootstrapping method reduces key sizes and runtime in FHE.
problem Large plaintext evaluation in FHE increases bootstrapping complexity.
method New polynomial vector representation and monic monomial permutation matrices.
result Polynomial factor improvement in key size and constant factor in runtime.
Deep-Lock secures DNN models with secret keys.
problem Preventing unauthorized usage of DNN models.
method Uses S-Boxes and key scheduling to encrypt DNN parameters.
result Ensures correct functioning only with the correct secret key.
Amortizes MIPS by training neural networks to predict optimal keys.
problem Efficiently solving Maximum Inner Product Search for repeated queries.
method Regression-based SupportNet and KeyNet models trained on support functions.
result Significant improvement in IVF match rates for document embeddings.
The variational autoencoder (VAE) is a popular probabilistic generative model. However, one shortcoming of VAEs is that the latent variables cannot be discrete, which makes it difficult to generate data from different modes of a distribution. Here, we propose an extension of the VAE framework that incorporates a classi…
Burnside keimath.GT
This paper is motivated by a general question: for which values of k and n is the universal Burnside kei of k generators and Kei "exponent" n, , finite? It is known (starting from the work of M. Takasaki (1942)) that is isomorphic to the dihedral quandle Z_n and is isomorphic to…
A new model protects deep learning models from GAN attacks.
problem Vulnerability of collaborative learning to GAN attacks.
method Introduces a key-based classification model and a training scheme using private keys.
result Resilient against GAN attacks without increasing model complexity.
New algorithm speeds up user preference learning in conversational contexts.
problem Limited performance of existing conversational contextual bandit approaches.
method Proposes ConLinUCB framework and two algorithms, ConLinUCB-BS and ConLinUCB-MCR, with explorative key-term selection.
result Proves tighter regret bounds and achieves significant computational efficiency improvements.
Facial Key Points (FKPs) Detection is an important and challenging problem in the fields of computer vision and machine learning. It involves predicting the co-ordinates of the FKPs, e.g. nose tip, center of eyes, etc, for a given face. In this paper, we propose a LeNet adapted Deep CNN model - NaimishNet, to operate o…
This paper describes several key discoveries in the 19th century that led to the modern theory of manifolds in the twentieth century: intrinsic differential geometry, projective geometry and higher dimensional manifolds and Riemannian geometry.
Randomized diversification defends machine learning models against adversarial attacks.
problem Vulnerability of machine learning systems to adversarial attacks.
method Multi-channel architecture with shared secret key for randomized transforms in a gray-box scenario.
result Increased robustness against various adversarial attacks.
Robustification of deep net classifiers by key based diversified aggregation with pre-filteringcs.LG
Proposes KDA to protect deep nets from adversarial attacks.
problem Machine learning system vulnerability to adversarial attacks.
method Key based diversified aggregation with pre-filtering.
result Demonstrates high robustness and universality against various attacks.
Differentially private weighted sampling improves privacy while maintaining utility.
problem Ensuring privacy in datasets with key-value pairs while preserving analytical utility.
method Private Weighted Sampling (PWS) that ensures element-level differential privacy.
result Significant performance gains in key reporting and estimation accuracy compared to prior methods.
Proofs for Moon's theorem and its generalization.
problem Proving Moon's theorem and its generalization.
method Proofs based on key lemmas.
result Generalization of the four-vertex theorem.
Summarizes key algorithmic trading problems and recent advances.
problem Optimal execution, placement, and price impact in algorithmic trading.
method Discusses recent advances in algorithmic trading using Machine Learning techniques.
result Recent progress in algorithmic trading includes the use of Deep Learning, Reinforcement Learning, and Generative Adversarial Networks.
New method finds infinitely many surface knots with specific bridge numbers.
problem Finding numerical invariants for surface links.
method Colorings of surface links by keis to prove bridge number existence.
result Existence of infinitely many surface knots with bridge number n for n ≥ 4.
Improves slot key and value prediction for unseen entities.
problem Dealing with unseen slot keys and values in real-world dialogue systems.
method Leverages external knowledge bases to project slots into an attribute space and generate candidate keys and values.
result Significant improvements in F1 score and accuracy (57.7% and 82.7%, respectively) over a previous approach.
The paper proposes a privacy-preserving algorithm for decentralized learning using public-key cryptography.
problem Preserving data privacy in decentralized learning.
method Public-key cryptography and anonymization techniques.
result A scheme that provides anonymity in decentralized learning with theoretical guarantees.
Cryptographic schemes use Thurston norm from 3-manifold topology.
problem Creating secure cryptographic keys.
method Public-key and symmetric-key schemes based on Thurston norm.
result Cryptographic security from 3-manifold topology.
Transformer-MGK replaces redundant heads with Gaussian key mixtures, improving efficiency and performance.
problem Redundant attention heads in transformers degrade performance and efficiency.
method Transformer-MGK replaces redundant heads with a mixture of Gaussian keys.
result Transformer-MGK accelerates training and inference, reduces parameters and FLOPs, and achieves comparable or better accuracy.
Customer Satisfaction is the most important factors in the industry irrespective of domain. Key Driver Analysis is a common practice in data science to help the business to evaluate the same. Understanding key features, which influence the outcome or dependent feature, is highly important in statistical model building.…
Training large-scale image recognition models is computationally expensive. This raises the question of whether there might be simple ways to improve the test performance of an already trained model without having to re-train or fine-tune it with new data. Here, we show that, surprisingly, this is indeed possible. The …
Doctors often rely on their past experience in order to diagnose patients. For a doctor with enough experience, almost every patient would have similarities to key cases seen in the past, and each new patient could be viewed as a mixture of these key past cases. Because doctors often tend to reason this way, an efficie…
Correlation Networks Among Currenciesphysics.soc-ph
By analyzing the foreign exchange market data of various currencies, we derive a hierarchical taxonomy of currencies constructing minimal-spanning trees. Clustered structure of the currencies and the key currency in each cluster are found. The clusters match nicely with the geographical regions of corresponding countri…
We introduce a data-based approach to estimating key quantities which arise in the study of nonlinear control systems and random nonlinear dynamical systems. Our approach hinges on the observation that much of the existing linear theory may be readily extended to nonlinear systems - with a reasonable expectation of suc…
The purpose of this paper is to extend the Green-Naghdi-Rivlin balance of energy method to continua with microstructure. The key idea is to replace the group of Galilean transformations with the group of diffeomorphisms of the ambient space. A key advantage is that one obtains in a natural way all the needed balance la…
Gradient flow on softmax attention minimizes nuclear norm of weight matrices.
problem Classification with separate key and query weight matrices.
method Gradient flow on exponential loss, separability assumption, reparameterization, approximate KKT conditions.
result Gradient flow implicitly minimizes nuclear norm of weight matrices, contrasting with Frobenius norm minimization.
Improves key instance detection in MIL models by using neural network inversion with sparseness constraint.
problem Limited key instance detection performance in attention-based deep MIL models due to skewed attention scores.
method Sparse network inversion with a sparseness constraint incorporated into neural network inversion, solved by proximal gradient method.
result Significantly improved key instance detection performance while maintaining bag-level prediction performance.
To answer the existence of optimal swimmer learning/teaching strategies, this work introduces a two-level clustering in order to analyze temporal dynamics of motor learning in breaststroke swimming. Each level have been performed through Sparse Fisher-EM, a unsupervised framework which can be applied efficiently on lar…
LIDS assesses LLM summaries with interpretable key words.
problem Challenges in evaluating the quality of LLM summaries.
method BERT-SVD-based direction metric and SOFARI for key word extraction.
result LIDS provides interpretable key words for layered themes.
Marked Graph Mosaicsmath.GT
Enhances knot counting using mosaic diagrams.
problem Counting and classifying surface-links and knots.
method Marked graph diagrams and mosaic numbers.
result Established bounds on mosaic numbers for surface-links.
In this work we give a comprehensive overview of the time consistency property of dynamic risk and performance measures, focusing on a the discrete time setup. The two key operational concepts used throughout are the notion of the LM-measure and the notion of the update rule that, we believe, are the key tools for stud…
Deep learning attacks chaos-based image encryption.
problem Chaos-based image encryption vulnerability.
method Project encrypted images to low-dimensional space, use deconvolutional generator to regenerate images.
result Proposes a key-independent, end-to-end trained method to attack chaos-based encryption.
We study the frictions in the patterns of trades in the Euro money market. We characterize the structure of lending relations during the period of recent financial turmoil. We use network-topology method on data from overnight transactions in the Electronic Market for Interbank Deposits (e-Mid) to investigate on two ma…
FF layers in transformers are nearly as interpretable as sparse autoencoders.
problem Comparing interpretability of feature vectors in FF layers vs. sparse autoencoders.
method Revisited interpretability of FF layers as key-value memories using modern benchmarks.
result FF and SAE feature vectors are similarly interpretable, but FFs can be better in some aspects.
Regina is a software package for studying 3-manifold triangulations and normal surfaces. It includes a graphical user interface and Python bindings, and also supports angle structures, census enumeration, combinatorial recognition of triangulations, and high-level functions such as 3-sphere recognition, unknot recognit…
This study examines a single attention layer's capabilities using random features.
problem Understanding the learning and generalization of a single multi-head attention layer.
method Random feature setting with large number of heads, frozen query and key matrices, and trainable value matrices.
result Random-feature attention layer can express a broad class of permutation-invariant target functions.
No accelerated gradient method for hyperbolic convex functions.
problem Existence of accelerated gradient methods for geodesically convex functions on hyperbolic spaces.
method Analysis of volume growth in negatively curved spaces.
result No-go theorem for accelerated gradient methods on hyperbolic plane.
Study analyzes factors affecting profits in crypto liquidity provision.
problem Liquidity providers lack guidance for developing profitable strategies.
method Developed a measurement model based on impermanent loss to analyze key parameters.
result Uncovered influences of key parameters on LPs' profits.
Classifies good involutions in conjugation subquandles and racks.
problem Classifying quandles with good involutions for applications in surface-knot theory.
method Study of subquandles of conjugation quandles, including core quandles; analysis of good involutions of faithful racks.
result Sharp bounds on the number of good involutions of racks in these families.
Classifies load forecasting studies by forecasting problem.
problem Selecting appropriate load forecasting techniques and methodologies.
method Classification based on two forecasting problem parameters.
result Synthetic view of relevant forecasting techniques and methodologies.
New method filters large networks from financial data to reveal key subnetworks.
problem Filtering large dimensional networks to isolate key constituents.
method Exploits spectral properties of high-dimensional data networks, tuning for sparsity and consistency.
result Shows method can interpolate between zero and maximal filtering, preserving spectral properties.
Predict and explain storage failures using RNNs with event extraction.
problem Predict and explain failures in storage environments from time series data.
method Extract anomalous spikes as events, then build an RNN classifier with attention mechanisms.
result Comparable accuracy to traditional RNNs with improved explainability.
SAM optimizer benefits from normalization, stabilizing and guiding optimization.
problem Improving deep neural network performance with SAM optimizer.
method Theoretical and empirical study of normalization in SAM for convex and non-convex functions.
result Normalization helps SAM in stabilizing and guiding optimization along a continuum of minima.
OSA overcomes instability in skipless Transformers.
problem Instability in skipless Transformers using Softmax Self-Attention.
method OSA parametrizes attention matrix to be orthogonal via skew-symmetric matrix exponential.
result OSA allows for training non-causal Transformers without skip connections and normalisation layers.
This paper uses MIS to identify key financial institutions with minimal risk contagion.
problem Mitigating systemic risk during extreme financial events.
method Applying extreme value theory and MIS from graph theory to identify diversified portfolios.
result Identified a subset of institutions with minimal extremal dependence for diversified portfolios.