Understanding optimal prompts for binary sequence predictors is challenging.
problem Finding good prompts for binary sequence predictors is difficult.
method Viewing prompting as finding the best conditioning sequence on a near-optimal sequence predictor, using empirical and statistical analysis.
result Optimal prompts can be better understood given the pretraining distribution, which is not usually available.
Open problem seeks an online learning algorithm for binary classification.
problem Existence of an online learning algorithm for binary classification with sublinear mistakes.
method Assumption of sequence allowing learning algorithm's existence.
result Specific condition determines sequence's learnability.
Paper explores learning patterns in binary sequences, finding no method consistently outperforms others.
problem Learning patterns in infinite binary sequences.
method Various learning methods are compared, finding no method consistently outperforms others.
result No learning method consistently outperforms others in predicting binary sequences.
Modeling and estimating dynamic graphs from binary pattern sequences.
problem Extracting dominant correlation structures from time-dependent binary patterns.
method State-space model of an Ising-type network composed of multiple undirected graphs, sequential Bayes algorithm.
result The method outperforms traditional methods in uncovering overlapping graphs and estimating dynamics of weights.
The paper analyzes network models with binary values and sub-Gamma noise, deriving asymptotic properties.
problem Analyzing network models with binary values and sub-Gamma noise.
method Derives asymptotic properties of network models with binary values and sub-Gamma noise.
result Established asymptotic consistency and normality of parameter estimators in network models.
This paper investigates the problem of determining a binary-valued function through a sequence of strategically selected queries. The focus is an algorithm called Generalized Binary Search (GBS). GBS is a well-known greedy algorithm for determining a binary-valued function through a sequence of strategically selected q…
We work with a generalization of knot theory, in which one diagram is reachable from another via a finite sequence of moves if a fixed condition, regarding the existence of certain morphisms in an associated category, is satisfied for every move of the sequence. This conditional setting leads to a possibility of irreve…
This research explores various sampling methods and probability distributions for hard alignment in sequence-to-sequence TTS synthesis.
problem Improving alignment accuracy in sequence-to-sequence text-to-speech synthesis.
method Investigated various sampling methods (greedy, beam, random) and probability distributions (Bernoulli, Concrete) for hard alignment.
result Deterministic search is more preferable than stochastic search for natural alignment transition.
This paper applies deep learning to ordinal regression, modeling it as a binary search.
problem Ordinal regression with deep learning models.
method Formulated ordinal regression as a binary search problem, using recurrent neural networks.
result Deep learning model shows comparable or better predictive power compared to traditional methods.
Paper bounds convergence rate of adversarial surrogate risk.
problem Vulnerability of binary classification models to adversarial attacks.
method Characterizes conditions for adversarial consistency and provides surrogate risk bounds.
result Surrogate risk bounds quantify the rate of convergence of adversarial classification risk.
In order to study large variations or fluctuations of finite or infinite sequences (time series), we bring to light an 1868 paper of Crofton and the (Cauchy-)Crofton theorem. After surveying occurrences of this result in the literature, we introduce the inconstancy of a sequence and we show why it seems more pertinent …
Binary and ternary weights simplify RNNs for mobile devices.
problem Complexity and memory intensity of RNNs on mobile devices.
method Learn binary and ternary weights during training.
result Significant memory saving and inference speedup on ASIC platform.
Adaptive correlated MC improves sequence generation stability.
problem High gradient variance in reinforcement learning for sequence generation.
method Adapts policy gradient estimator using correlated Monte Carlo rollouts.
result Reduces gradient variance and improves model performance.
Based on the misleading expectation that weighted network properties always offer a more complete description than purely topological ones, current economic models of the International Trade Network (ITN) generally aim at explaining local weighted properties, not local binary ones. Here we complement our analysis of th…
Contradiction graphs reveal VC dimension threshold.
problem Determining VC dimension of concept classes.
method Study contradiction graphs of binary concept classes.
result Single contradiction graph Gm(H) determines VC dimension. This work learns shared word embeddings for acoustic and phonetic sequences.
problem Mapping variable-length acoustic and phonetic sequences to fixed-dimensional vectors.
method Weak supervision and binary classification task to predict word similarity.
result Best model achieves an F1 score of 0.95 for binary classification.
A new framework predicts links in time-dependent networks using Bernoulli autoregression.
problem Predicting links in time-dependent networks with additional auxiliary information.
method A Bernoulli autoregressive model with regularization for link discovery.
result The model can discover new links not present in the data.
We consider active maximum a posteriori (MAP) inference problem for Hidden Markov Models (HMM), where, given an initial MAP estimate of the hidden sequence, we select to label certain states in the sequence to improve the estimation accuracy of the remaining states. We develop an analytical approach to this problem for…
We develop a method to predict the average of a binary sequence with bounded error.
problem Predicting the average of a binary sequence with selective prediction.
method Online prediction algorithm with adaptive window selection.
result Expected squared error of O(logn1) for predicting the average. We obtain an index of the complexity of a random sequence by allowing the role of the measure in classical probability theory to be played by a function we call the generating mechanism. Typically, this generating mechanism will be a finite automata. We generate a set of biased sequences by applying a finite state auto…
The international trade network (ITN) has received renewed multidisciplinary interest due to recent advances in network theory. However, it is still unclear whether a network approach conveys additional, nontrivial information with respect to traditional international-economics analyses that describe world trade only i…
Cryptocurrencies are ranked for efficiency using a new Complexity-Entropy Plane.
problem Evaluating the efficiency of cryptocurrencies using traditional financial metrics.
method Developed a Binary Complexity-Entropy Plane (BiCEP) to analyze daily price fluctuations of major cryptocurrencies.
result Only Shiba Inu (SHIB) is significantly inefficient, while most cryptocurrencies operate in close-to-efficient conditions.
Graphs from van der Corput sequence embed into Chamanara surface.
problem Embedding graphs from van der Corput sequence into surfaces.
method Constructed 4-regular graphs from van der Corput sequence and Kronecker sequence, embedded into torus and Chamanara surface. result Graphs from van der Corput sequence embed into Chamanara surface with one edge removal.
Paper solves NP-hard haplotyping problem using matrix completion.
problem Reconstructing inherited genetic variations from DNA sequencing data.
method Binary matrix factorization and alternating minimization.
result The proposed technique achieves lower haplotype reconstruction error.
We consider a binary sequence generated by thresholding a hidden continuous sequence. The hidden variables are assumed to have a compound symmetry covariance structure with a single parameter characterizing the common correlation. We study the parameter estimation problem under such one-parameter models. We demonstrate…
Branching Flows generates sequences of varying lengths using binary trees.
problem Generating sequences of unknown lengths or fixed elements.
method A generative modeling framework that evolves states over binary trees, controlling sequence length.
result Branching Flows can generate sequences of varying lengths and mix different types of state spaces.
Machine learning for entropy calculation from binary signals.
problem Calculating entropy from binary configurations/signals.
method Transformed entropy calculation into supervised classification tasks using machine learning.
result Reproduced entropy and free energy of the 2D Ising model.
We study the arbitrage opportunities in the presence of transaction costs in a sequence of binary markets approximating the fractional Black-Scholes model. This approximating sequence was constructed by Sottinen and named fractional binary markets. Since, in the frictionless case, these markets admit arbitrage, we aim …
sCSC clusters data without prior assumptions, revealing natural groupings.
problem Clustering data without prior knowledge of its structure.
method sCSC performs binary splittings maximizing dissimilarity, producing a binary tree.
result Clusters emerge naturally from the binary tree, revealing data structure.
Sharp analysis of isotonic regression for binary data, improving calibration bounds.
problem Improving the calibration of probabilistic predictors using isotonic regression.
method Sharp finite-sample characterization of isotonic regression's degrees of freedom using analytic number theory.
result First nontrivial distribution-free guarantee on Expected Calibration Error (ECE) of isotonic regression.
Paper finds Dutch Draw optimal baseline for binary classification.
problem Need a proper baseline for binary classification validation.
method Examined all input-independent baseline methods.
result Dutch Draw is optimal baseline under given conditions.
Generates positive examples from noisy data streams.
problem Learning from noisy example streams in hypothesis classes.
method Extending results from previous studies to account for noise.
result Conditions for noisily generatable binary hypothesis classes.
Study potential computational gaps in symmetric binary perceptrons using fl-RDT.
problem Potential statistical-computational gaps in symmetric binary perceptrons.
method Parametric utilization of fully lifted random duality theory (fl-RDT).
result Observation of a computational gap SCG=αc−αa in SBP. A sequential classifier minimizes test samples for binary and multi-class classification.
problem Minimizing test samples for sequential classification with unknown distributions.
method Proposes a classifier for binary and multi-class problems, analyzing error probabilities and extending results.
result Significant advantage over non-sequential classifiers, achieving same exponents without rejection option.
CEDA analyzes large categorical datasets using tree geometry and binary codes.
problem Analyzing large categorical datasets with extreme-K samples. method CEDA uses tree geometry and binary codes to analyze categorical data.
result CEDA discovers patterns and evaluates their reliability in large categorical datasets.
A fast binary embedding method preserves Euclidean distances in high-dimensional data.
problem Preserving Euclidean distances in high-dimensional datasets.
method Stable noise-shaping quantization of Ax with A a sparse Gaussian random matrix, followed by a linear transformation. result Euclidean distances are approximated by the ℓ1 norm on binary sequences, leading to accurate binary codes. Paper tackles binary feedbacks in contextual search learning.
problem Learning underlying mean value function in context with binary feedbacks.
method Tri-section search combined with margin-based active learning.
result Algorithm achieves O(1/ε2) queries for ε-estimation accuracy. Improved upper bound for online calibrated forecasting of binary sequences.
problem Online calibrated forecasting of binary sequences.
method Introducing a variant of Qiao & Valiant's sign preservation game called sign preservation with reuse (SPR) and proving its equivalence to calibrated forecasting.
result Improved upper bound of O(T2/3−ε) for calibrated forecasting, improving the O(T2/3) bound of Foster & Vohra. New method detects TC imagery patterns for rapid intensity change.
problem Detecting upcoming rapid intensity changes in TC satellite imagery.
method Nonparametric test of association between images and event labels using neural networks and bootstrap.
result Identifies archetypes of infrared imagery associated with elevated rapid intensification risk.
In this article we associate a combinatorial differential graded algebra to a cubic planar graph G. This algebra is defined combinatorially by counting binary sequences, which we introduce, and several explicit computations are provided. In addition, in the appendix by K. Sackel the F(q)-rational points of its graded a…
We introduce a version of Khovanov homology for alternating links with marking data, ω, inspired by instanton theory. We show that the analogue of the spectral sequence from Khovanov homology to singular instanton homology introduced in \cite{KM_unknot} for this marked Khovanov homology collapses on the E2 page fo…
New insights into binary perceptron reveal phase transitions and algorithmic thresholds.
problem Understanding the statistical-computational gap in binary perceptron models.
method Application of fully lifted random duality theory (fl RDT) to uncover structural changes.
result Numerical estimates of constraint density thresholds align with theoretical predictions.
Study examines noise sensitivity of DNNs for binary classification.
problem Understanding non-robustness of DNN classifiers under noise.
method Defined and extended noise sensitivity and stability concepts for Boolean functions, applied to DNN models.
result Sorted out the relation between definitions and properties of DNN architectures under noise.
In this work we introduce malware detection from raw byte sequences as a fruitful research area to the larger machine learning community. Building a neural network for such a problem presents a number of interesting challenges that have not occurred in tasks such as image processing or NLP. In particular, we note that …
New methods improve neural network extrapolation to long sequences.
problem Neural networks struggle with extrapolation to very long or adversarial sequences.
method Activation binning and localized differentiable memory architecture.
result No extrapolation errors detected within memory constraints.
Enhances fraud detection with multiple HMM perspectives.
problem Detecting credit card fraud from sequential transactions.
method Modeling credit card transactions from three perspectives (card-holder, terminal, amount/time) using HMMs and combining likelihoods as features.
result 15% increase in precision-recall AUC compared to state-of-the-art methods.
New optimization method improves AUC for binary classification and changepoint detection.
problem Non-convex AUC and sub-optimal points in ROC curves.
method AUM (Area Under Min(FP, FN)) surrogate loss function based on sorting and summing ROC curve points.
result AUM minimization learning algorithm improves AUC and speeds up compared to previous methods.
Insertion Transformer generates sequences with flexible insertion orders.
problem Generating sequences with arbitrary orderings.
method Iterative, partially autoregressive model with insertion operations.
result Outperforms non-autoregressive approaches in translation tasks.