DeepTMR reorders matrices without prior knowledge of structural patterns.
problem Matrix reordering without prior structural knowledge.
method DeepTMR uses a neural network to automatically extract features and reorder matrices.
result Trained network produces denoised mean matrix for visualization.
AutoLL uses neural networks to automatically reorder graph nodes for linear layouts.
problem Finding optimal node order in adjacency matrices without predefined features.
method Developed AutoLL-D and AutoLL-U neural network models for one-mode reordering of directed and undirected graphs.
result Demonstrated effectiveness of AutoLL through qualitative and quantitative evaluations.
New algorithm optimizes matrix reordering for noisy disordered matrices.
problem Optimizing matrix reordering for noisy disordered matrices in single-cell biology and metagenomics.
method Proposed a polynomial-time adaptive sorting algorithm to improve upon spectral seriation.
result Our algorithm achieves superior performance compared to existing methods in real datasets.
In (exploratory) factor analysis, the loading matrix is identified only up to orthogonal rotation. For identifiability, one thus often takes the loading matrix to be lower triangular with positive diagonal entries. In Bayesian inference, a standard practice is then to specify a prior under which the loadings are indepe…
We explore under what conditions one can obtain a nontrivial knot, given a collection of n vectors. First, we show how to get a crossing from any 3 vectors equal in magnitude, by arbitrarily picking 2 vectors and identifying the sufficient and necessary criteria for picking a third vector that will guarantee a crossi…
Maximal extractable value in CFMMs can degrade or improve routing quality, with reordering MEV showing logarithmic impact.
problem Maximal extractable value in constant function market makers (CFMMs) and its impact on routing quality.
method Game theoretic analysis of MEV in CFMMs, constructing price of anarchy and analyzing reordering MEV.
result Conditions under which reordering MEV shows logarithmic impact, and implications for MEV searchers and CFMM designers.
This work introduces uncertainty principles to mitigate Maximal Extractable Value in blockchain systems.
problem Maximal Extractable Value (MEV) in decentralized systems due to transaction submission privacy and monopolist power.
method Unified approaches via uncertainty principles, akin to harmonic analysis and physics, to quantify trade-offs between transaction flexibility and user economic payoff.
result Demonstrates a quantitative trade-off between transaction flexibility and user economic payoff, analogous to the Nyquist-Shannon sampling theorem.
Ethereum block builders can earn up to $14M/month by reordering transactions, harming users.
problem Block builders can exploit transaction reordering to earn significant profits, harming users.
method Estimation of MEV payments and analysis of reordering effects.
result Block builders can earn up to $14M/month by reordering transactions, skewing the distribution.
Unified optimization framework for matrix seriation.
problem Discovering latent structure in relational data.
method Mathematical optimization models for seriation.
result Optimization models enhance solution quality and interpretability.
We propose a representation of graph as a functional object derived from the power iteration of the underlying adjacency matrix. The proposed functional representation is a graph invariant, i.e., the functional remains unchanged under any reordering of the vertices. This property eliminates the difficulty of handling e…
We describe a seriation algorithm for ranking a set of items given pairwise comparisons between these items. Intuitively, the algorithm assigns similar rankings to items that compare similarly with all others. It does so by constructing a similarity matrix from pairwise comparisons, using seriation methods to reorder t…
Proposes tPARAFAC2 for tracking evolving patterns in time-evolving data.
problem Lack of temporal regularization in tensor factorizations for capturing evolving patterns.
method Temporal PARAFAC2 (tPARAFAC2) with temporal regularization.
result tPARAFAC2 accurately captures evolving patterns better than existing methods.
Study examines trading costs on Uniswap, finding adversarial slippage is significant for large trades and certain assets.
problem Analyzing costs and slippage in decentralized exchanges (DEXs).
method Empirical evaluation of Uniswap's USDC-ETH and PEPE-ETH pools, calculating slippage and reordering slippage.
result Adversarial slippage is significant for large trades and certain assets like PEPE.
PRRO generates synthetic tabular data that improves SL performance and class distribution.
problem Low SL utility of synthetic data due to class imbalance and overlooked data relationships.
method Data pruning and column reordering to optimize SL utility.
result Synthetic data generated with PRRO enhances predictive performance and class distribution.
Efficiently learns and transports posterior densities for real-time inference.
problem High computational cost of Bayesian inference for complex posterior densities.
method Tensor-train (TT) format for offline learning, conditional transport for online inference.
result Significant improvement in inference performance for high-dimensional problems.
Designing deep learning models for highly-constrained hardware would allow imbuing many edge devices with intelligence. Microcontrollers (MCUs) are an attractive platform for building smart devices due to their low cost, wide availability, and modest power usage. However, they lack the computational resources to run ne…
cGAP visualizes high-dimensional categorical data with interpretable geometric structure.
problem Lack of visualization tools for high-dimensional categorical data.
method cGAP uses Homogeneity Analysis (HOMALS) to embed data in a 3D space and maps it to colors.
result cGAP reveals coherent clusters, outliers, and local-to-global structure in categorical data.
cGAP visualizes high-dimensional categorical data with interpretable geometric structure.
problem Lack of visualization tools for high-dimensional categorical data.
method cGAP uses Homogeneity Analysis (HOMALS) to embed data in a 3D space and maps it to colors for visualization.
result cGAP reveals coherent clusters, outliers, and local-to-global structure in categorical data.
New method reduces summary points for datasets while maintaining quality.
problem Thinning datasets to reduce summary points while maintaining quality.
method Low-rank analysis of sub-Gaussian thinning.
result Guarantees high-quality compression for any distribution and kernel.
Paper improves uncertainty estimation in LLM-as-a-judge systems.
problem Improving uncertainty estimation in LLM-as-a-judge frameworks.
method Generalised probabilistic modelling and improved uncertainty estimates.
result Proposed uncertainty estimates significantly improve system efficiency.
New estimators reduce computation for Kendall's tau and conditional Kendall's tau matrices under structural assumptions.
problem Efficient estimation of Kendall's tau and conditional Kendall's tau matrices for large dimensions.
method Averaging pairwise estimates over blocks or conditional estimates, exploiting structural assumptions.
result Improved estimators with reduced computational cost and similar error level.
Hyperfitting improves LLM generation quality by enhancing diversity, contrary to simple temperature scaling.
problem Improving open-ended generation quality of LLMs with minimal fine-tuning effort.
method Demonstrates that hyperfitting, a phenomenon where LLMs are fine-tuned to near-zero training loss, enhances generation quality and mitigates repetition.
result Hyperfitting is distinct from temperature scaling and involves a dynamic, context-dependent rank reordering mechanism in the final transformer block.
Analyzes tt*-structures from ADE-type Stokes data.
problem Classifying tt*-structures over C∗. method Isomonodromic deformations with upper unitriangular real Stokes matrices.
result Establishes a direct analytic realization of the ADE classification. Deep model learns protein interfaces from high-order interactions.
problem Predicting protein interfaces from amino acid pairs.
method Graph neural networks and convolutional neural networks for 2D dense predictions.
result Our method consistently improves interface prediction performance.
We propose a mixed integer programming (MIP) model and iterative algorithms based on topological orders to solve optimization problems with acyclic constraints on a directed graph. The proposed MIP model has a significantly lower number of constraints compared to popular MIP models based on cycle elimination constraint…
In this paper, we present Neural Phrase-based Machine Translation (NPMT). Our method explicitly models the phrase structures in output sequences using Sleep-WAke Networks (SWAN), a recently proposed segmentation-based sequence modeling method. To mitigate the monotonic alignment requirement of SWAN, we introduce a new …
Seq2Tens uses tensors to efficiently represent sequences, improving performance on time series and video tasks.
problem Challenges in analyzing sequential data due to complex dependencies and non-commutativity.
method Uses tensor algebra to capture dependencies and low-rank tensor projections to manage computational complexity.
result State-of-the-art performance on multivariate time series classification and video generation benchmarks.
We consider a simple and overarching representation for permutation-invariant functions of sequences (or multiset functions). Our approach, which we call Janossy pooling, expresses a permutation-invariant function as the average of a permutation-sensitive function applied to all reorderings of the input sequence. This …
We study the space $\nua{m}{d}$ of clouds in $\bbr^d$ (ordered sets of m points modulo the action of the group of affine isometries). We show that $\nua{m}{d}$ is a smooth space, stratified over a certain hyperplane arrangement in $\bbr^m$. We give an algorithm to list all the chambers and other strata (this is indep…
It is challenging for stochastic optimizations to handle large-scale sensitive data safely. Recently, Duchi et al. proposed private sampling strategy to solve privacy leakage in stochastic optimizations. However, this strategy leads to robustness degeneration, since this strategy is equal to the noise injection on each…
Quantum algorithm samples from SDEs using DQCs and quantile mechanics.
problem Sampling from solutions of stochastic differential equations.
method Differentiable quantum circuits (DQCs) encoding latent variables, quantile mechanics.
result Quantum algorithm generates time-series from SDEs.
Learning from unordered sets is a fundamental learning setup, recently attracting increasing attention. Research in this area has focused on the case where elements of the set are represented by feature vectors, and far less emphasis has been given to the common case where set elements themselves adhere to their own sy…
Research analyzes ethical concerns around MEV on blockchain and social media.
problem Fairness issues in transaction ordering on blockchain.
method Applied NLP methods to analyze topics in tweets on MEV.
result Tweets discussed ethical concerns like security, equity, and solutions to MEV.
Convolutional Neural Networks (CNNs) have demonstrated state-of-the-art performance on many visual recognition tasks. However, the combination of convolution and pooling operations only shows invariance to small local location changes in meaningful objects in input. Sometimes, such networks are trained using data augme…
New model optimizes portfolios with realistic transaction costs.
problem Real-world transaction costs impact portfolio profitability.
method DPGRGT model with 2D relative-attentional Gated Transformer.
result Model outperforms baseline models in U.S. stock market data.
Unified framework connects different neural network models.
problem Understanding the geometry of neural network loss landscapes.
method Unified framework capturing four symmetry classes.
result First discovery of low- and zero-barrier linear interpolation paths.
We propose several novel methods for enhancing the multi-class SVMs by applying the generalization performance of binary classifiers as the core idea. This concept will be applied on the existing algorithms, i.e., the Decision Directed Acyclic Graph (DDAG), the Adaptive Directed Acyclic Graphs (ADAG), and Max Wins. Alt…
How can we find patterns and anomalies in a tensor, or multi-dimensional array, in an efficient and directly interpretable way? How can we do this in an online environment, where a new tensor arrives each time step? Finding patterns and anomalies in a tensor is a crucial problem with many applications, including buildi…
New analysis reveals gaps in selective classifiers, guiding improvements.
problem Improving selective classifiers to match perfect-ordering oracle performance.
method Formalized selective classification gap, decomposed into five sources of looseness.
result Monotone post-hoc calibration has limited impact on closing the gap.
The paper constructs Goeritz matrices from Dehn colorings.
problem Constructing Goeritz matrices from Dehn colorings.
method Purely algebraic construction of Goeritz matrices from Dehn coloring matrices for prime knot diagrams.
result A new method to construct Goeritz matrices from Dehn colorings.
New matrix reveals cluster info in sparse directed graphs.
problem Analyzing cluster information in directed graphs.
method Proposed complex non-backtracking matrix integrating Hermitian adjacency matrix and non-backtracking matrix properties.
result The complex non-backtracking matrix holds cluster information, especially for sparse directed graphs.
The CN matrix of a pure braid projection is characterized and applied.
problem Understanding the structure of CN matrices for braid projections.
method Discussion and characterization of patterns and specific matrices.
result Characterization of CN matrix of a pure 6-braid projection and related matrices.
New MHSNs extract multiscale features from complex data for robust classification.
problem Signal classification and domain classification on complex data.
method Layered structure with multiscale basis dictionaries, pooling operations, and invariant features.
result High-accuracy classification with fewer parameters than traditional graph neural networks.
Generalised matrix-matrix multiplication forms the kernel of many mathematical algorithms. A faster matrix-matrix multiply immediately benefits these algorithms. In this paper we implement efficient matrix multiplication for large matrices using the floating point Intel Pentium SIMD (Single Instruction Multiple Data) a…
Characterizes the OU matrix for up to 5 strands in braids.
problem Understanding the structure of braid diagrams through their matrices.
method Characterization of the OU matrix for up to 5 strands in braids.
result Standard form of the OU matrix for general braids of up to 5 strands is given and characterized.
Classifies SL(n) covariant matrix-valued valuations on Lp-spaces.
problem Classifying SL(n) covariant matrix-valued valuations on Lp-spaces.
method Established a complete classification for continuous and SL(n) covariant matrix-valued valuations on Lp(Rn,|x|2dx), eliminating matrix symmetry assumption.
result Unique characterization of such valuations by the moment matrix in n>2, rotation matrix in 2D.
Unified approach for robust low rank matrix estimation with adversaries.
problem Robust low rank matrix estimation in the presence of adversaries.
method Unified approach combining Huber loss and nuclear norm penalization.
result Sharp estimation error bounds for matrix compressed sensing and completion.
Most recent results in matrix completion assume that the matrix under consideration is low-rank or that the columns are in a union of low-rank subspaces. In real-world settings, however, the linear structure underlying these models is distorted by a (typically unknown) nonlinear transformation. This paper addresses the…