Bit threads prove holographic monogamy of mutual information.
problem Proving the monogamy of mutual information in holographic entanglement.
method Using bit threads and multicommodity flow adapted from network theory, combined with convex optimization tools.
result Proved the monogamy of mutual information property of holographic entanglement entropies.
We discuss Darboux-Staude type of thread configurations for the ellipsoid similar to Chasles-Graves type of thread configurations for the ellipse. These threads are formed by rectilinear segments, geodesic and line of curvature segments on the considered ellipsoid and with tangents tangent to the given ellipsoid and a …
Study on bit threads and their locking properties in holographic spacetimes.
problem Understanding the conditions under which regions can be locked in holographic spacetimes.
method Investigation of different density bounds and their implications on the locking of regions.
result Non-crossing regions can be locked under the most stringent bound, but crossing regions cannot.
Algorithm uncovers roles and sub-communities in online forums.
problem Identifying roles and sub-communities in online forums.
method Scalable algorithm based on stochastic variational inference and topic models.
result Model outperforms existing methods in predicting user behavior.
New method splits Einstein field equations for general spacetime threading.
problem Solving Einstein field equations in complex spacetime geometries.
method General (1+3) threading approach to split EFE and conservation laws.
result Perturbation Friedman equations derived in almost FLRW universe.
Closed formulas for η-corrections in the once-punctured torus identified.
problem Identifying η-corrections in the Kauffman bracket skein algebra of the once-punctured torus.
method Explicit closed formulas for Chebyshev-threaded families and η-corrections.
result Explicit Chebyshev expansions and coefficients for η-corrections.
(NOTE: per referee comments, this article has been split; it is now superseded by "Existence of thread-wire minimizers" and "Near-wire thread-wire minimizers"; please see http://www.bkstephens.net.) Alt's thread problem asks for least-area surfaces bounding a fixed "wire" curve and a movable "thread" curve of length L.…
Study of motion equations in a 5D universe with special threading.
problem Formulating equations of motion in a 5D spacetime.
method Covariant formulation of motion equations with respect to (1+1+3) threading. result Introduction and study of a 5D Robertson-Walker universe.
New approach to holographic entanglement using bit threads and max flow-min cut principle.
problem Clarifying the Ryu-Takayanagi formula and its applications in holographic theories.
method Introducing bit threads and max flow-min cut principle to rewrite Ryu-Takayanagi formula.
result Flow-based proofs of strong subadditivity and related properties clarify the RT formula.
Study identifies stable configurations of intertwined threads with repulsive interactions.
problem Stable configurations of entangled systems with repulsive interactions.
method Analysis of steepest descent flow of an energy functional.
result Existence and uniqueness of stable configuration of two layers drifting apart at t1/3 rate. Given a knot diagram D, we construct a semi-threading circle for it which can be an axis of D as a closed braid depending on knot diagrams. In particular, we consider semi-threading circles for minimal diagrams of a knot with respect to overpasses which give us some information related to the braid index. By this n…
System classifies Twitter and Reddit posts' stance towards hidden rumour threads.
problem Classifying posts' stance towards hidden rumour threads.
method Used pre-trained deep bidirectional transformers (BERT) for stance classification.
result Reached F1 score of 61.67% on test data, 2nd place in competition.
A new deep metric learning method for defect classification in threaded pipe connections.
problem Defect classification in threaded pipe connections with limited and imbalanced multichannel functional data.
method COMPILED approach based on deep metric learning for imbalanced, multichannel, and partially observed functional data.
result Superior accuracy compared to existing benchmarks in a real-world case study.
Accelerator synthesizes deep learning inference from C code using FPGA hardware.
problem Efficiently implementing deep learning models on FPGAs.
method Parallelized C code using Pthreads, high-level synthesis, reduced precision, zero-weight-skipping.
result Peak performance of 138 effective GOPS on VGG-16 on Intel Arria 10 SoC FPGA.
HiGrad provides statistical inference for SGD without extra cost.
problem Statistical inference for online learning with SGD.
method Hierarchical SGD with covariance structure decorrelation.
result HiGrad confidence intervals achieve asymptotically exact coverage.
Study G2 skein algebra elements using Kuperberg webs and threading operations.
problem Identify and analyze central elements in G2 skein algebra. method Use Kuperberg webs, threading operations, and skein-theoretic arguments.
result Verify central elements and obtain uniqueness of transparent polynomials.
We develop a new approach on the (1+3) threading of spacetime (M,g) with respect to a congruence of curves defined by an arbitrary timelike vector field. The study is based on spatial tensor fields and on the Riemannian spatial connection ∇⋆, which behave as 3D geometric objects. We obtain new formul…
DeepTraderX learns from other strategies to place market orders.
problem Creating efficient trading strategies in multi-threaded market simulations.
method Deep Learning model trained on historical market data to predict optimal market orders.
result DeepTraderX outperforms existing strategies in multi-threaded market simulations.
GoSGD speeds up deep learning training with gossip exchange.
problem Speeding up the training of deep learning models.
method Distributed optimization using stochastic gradient descent with gossip algorithms.
result GoSGD achieves fully asynchronous and decentralized training.
We present a numerical model for the dynamics of thin viscous threads based on a discrete, Lagrangian formulation of the smooth equations. The model makes use of a condensed set of coordinates, called the centerline/spin representation: the kinematical constraints linking the centerline's tangent to the orientation of …
Quantum Frobenius map for SL3 skein modules constructed and described.
problem Constructing a quantum Frobenius map for SL3 skein modules. method Using threading polynomials and the Frobenius map of Parshall-Wang for quantum group Oq(SL3). result Described the quantum Frobenius map for SL3 skein modules. A new gossip-based method speeds up deep learning training.
problem Speeding up the training of convolutional networks.
method A distributed method inspired by gossip algorithms, using asynchronous and decentralized parallel optimization.
result GoSGD shows good consensus convergence properties and competitive performance compared to EASGD.
New simulation shows trading algorithms' performance varies with parallelism.
problem Validation of trading algorithms' performance in parallel markets.
method Used TBSE, a threaded market simulator, to compare algorithms' performance.
result Trading algorithms' performance differs in parallel vs. sequential markets.
We expect manifolds obtained by Dehn filling to inherit properties from the knot manifold. To what extent does that hold true for the Heegaard structure? We study four changes to the Heegaard structure that may occur after filling: (1) Heegaard genus decreases, (2) a new Heegaard surface is created, (3) a non-stabilize…
Self-Organizing Maps (SOM) are popular unsupervised artificial neural network used to reduce dimensions and visualize data. Visual interpretation from Self-Organizing Maps (SOM) has been limited due to grid approach of data representation, which makes inter-scenario analysis impossible. The paper proposes a new way to …
AI agents on social networks rarely engage in extended conversations.
problem Understanding the persistence of interactions in AI-agent social networks.
method Analysis of Moltbook, a social network of AI agents, using interaction half-life and spectral tests.
result Most comments on Moltbook receive a direct reply within seconds, indicating a ``fast response or silence'' regime.
This paper optimizes object tracking on edge devices with small matrices.
problem Efficiently tracking objects in video sequences on edge devices with small matrices.
method Parallelized a Simple Online and Real-time Tracking (SORT) application on shared-memory multicores.
result Throughput-based parallelization technique outperforms multi-threading for small matrices.
SYMSGD improves parallel SGD by combining local models to match sequential SGD's results.
problem Inherently sequential nature of SGD limits parallel scalability and convergence.
method SYMSGD combines local models with a combiner to mimic sequential SGD's semantics.
result SYMSGD achieves up to 11x speedup on 16 cores compared to a sequential baseline.
This paper classifies a specific weave type by their crossing number.
problem Classifying doubly periodic untwisted (p,q)-weaves.
method Classification by crossing number, introducing crossing matrix for equivalence.
result Classification of untwisted (p,q)-weaves by their crossing number.
We present a generic framework for parallel coordinate descent (CD) algorithms that includes, as special cases, the original sequential algorithms Cyclic CD and Stochastic CD, as well as the recent parallel Shotgun algorithm. We introduce two novel parallel algorithms that are also special cases---Thread-Greedy CD and …
Algorithm of construction of all knots, links with given number of crosses on diagram of knot, link is offered. This algorithm is based on simple proposition, that there is a representation of knot (link) as closure of braid with n threads and length of this braid does not exceed n(4n-5)+2.
SplitSGD dynamically adjusts learning rate based on stationarity detection.
problem Optimizing learning rates for stochastic optimization.
method SplitSGD uses a simple stationarity detection method to adjust learning rates.
result SplitSGD improves generalization and outperforms other adaptive methods.
BBE simulates sports betting exchanges for data generation.
problem Creating synthetic data for betting strategy testing.
method Agent-based model (ABM) for sports betting exchange simulation.
result Simulation runs up to 1000 times faster with GPU.
We first review the notion of a G2-manifold, defined in terms of a principal G2 ("gauge") bundle over a 7-dimensional manifold, before discussing their relation to supergravity. In a second thread, we focus on associative submanifolds and present their deformation theory. In particular, we elaborate on a deform…
Paper surveys Johnson homomorphisms and related tools.
problem Understanding generalized Johnson homomorphisms and their stable images.
method Surveying and unifying various related threads in literature using Hodge theory.
result Clarification of existing results and relationships among Johnson homomorphisms.
Analyzes privatizations, mergers, and acquisitions in Mexico's big companies.
problem Understanding economic structural changes and global market insertion.
method Examines the evolution of privatizations, mergers, and acquisitions in Mexico's large companies over the past decades.
result Identifies conductive threads leading to economic changes and global market insertion.
Post-quantum cryptography needed for blockchain security.
problem Quantum computers threaten traditional blockchain cryptography.
method Review of theoretical cryptography and quantum information theory.
result Post-quantum cryptography is essential for blockchain security.
Paper characterizes isotopies and hyperbolicity of weaves using geodesics.
problem Characterizing isotopies and hyperbolicity of weaves.
method Using diagrams of closed geodesics and normal positions of essential surfaces.
result Weaves are hyperbolic and cannot have essential Conway spheres.
This paper improves neural network training performance by optimizing concurrency and operation scheduling.
problem Managing and scheduling fine-grained operations in neural network training for high performance.
method Extending TensorFlow runtime to enable automatic concurrency control and scheduling, using performance modeling.
result Achieved 33% average performance improvement on neural network models, up to 49%.
This paper uses supervised learning to predict optimal chunk-size for parallel linear algebra operations.
problem Finding the optimal chunk-size for parallel linear algebra operations.
method The paper uses supervised learning models (logistic regression, neural networks, decision trees) to predict the optimal chunk-size for multiple linear algebra operations.
result The custom decision tree model outperforms classical decision trees and other models in predicting optimal chunk-size for linear algebra operations.
Unified view of improving tree model interpretability and debiasing feature importance.
problem Improving interpretability and debiasing feature importance in tree-based models.
method Demonstrates a common thread among bias correction methods and local explanations for trees.
result Points out a bias in explainable AI for trees algorithms due to inbag data inclusion.
First-order methods avoid saddle points for most initializations.
problem Avoiding saddle points in optimization problems.
method First-order methods, including gradient descent and variants, analyzed using dynamical systems and the Stable Manifold Theorem.
result First-order methods avoid saddle points for almost all initializations.
liquidSVM speeds up SVM for various tasks.
problem Efficiently solving SVM for large datasets.
method C++ implementation, hyper-parameter selection, multi-threading, GPU support, data decomposition.
result Unprecedented speed for small and large datasets.
Extended analysis of Q-learning's efficiency, matching optimal regret.
problem Theoretical guarantees of Q-learning's efficiency and optimal regret.
method Survey of related research, detailed proof reasoning.
result Q-learning with UCB exploration achieves sample efficiency matching optimal regret.
Efficient pathwise gradient estimators for multivariate distributions.
problem Constructing efficient gradient estimators for multivariate distributions.
method Using null solutions of the transport equation and control variates for gradient estimation.
result Pathwise gradient estimators for mixtures of multivariate Normal distributions can outperform other methods in high dimensions.
We develop parallel and distributed Frank-Wolfe algorithms; the former on shared memory machines with mini-batching, and the latter in a delayed update framework. Whenever possible, we perform computations asynchronously, which helps attain speedups on multicore machines as well as in distributed environments. Moreover…
The paper proves conditions for vector bundles to be Kobayashi and Griffiths positive.
problem Conditions for vector bundles to be Kobayashi and Griffiths positive.
method Comparing the curvature of (detE∗)k and SkE for large k and using duality of convex Finsler metrics. result Conditions for vector bundles to be Kobayashi and Griffiths positive.
The paper uses permutation representations to visualize group extensions and subgroups.
problem Visualizing and understanding group extensions and subgroups.
method Developing metaphoric rope-thread diagrams to represent semi-direct products and their constituents.
result Injective homomorphisms into semi-direct products are established.