Paper clarifies unary vs binary AV approaches and evaluates their performance.
problem Improperly treating authorship verification as a binary classification task.
method Literature review and evaluation of unary and binary AV methods.
result Improper binary classification leads to flawed AV methods.
New Bol operators identified on superstrings.
problem Classifying Bol operators on superstrings.
method Invariant classification of Bol operators on supermanifolds.
result Many new Bol operators discovered.
Exact inference in structured prediction for various graphs.
problem Exact recovery of labels in structured prediction models.
method Analysis of graph structures and application of Cheeger's inequality.
result Exact recovery is possible and achievable in polynomial time for a large class of graphs.
Photonic chip speeds up option pricing with GAN for financial efficiency.
problem Bottleneck in classical computing limits financial industry development.
method Unary approach, photonic chip, quantum amplitude estimation, GAN for asset distribution.
result Quadratic speedup over classical Monte Carlo methods.
Modern deep transfer learning approaches have mainly focused on learning generic feature vectors from one task that are transferable to other tasks, such as word embeddings in language and pretrained convolutional features in vision. However, these approaches usually transfer unary features and largely ignore more stru…
We introduce the notions of Atiyah class and Todd class of a differential graded vector bundle with respect to a differential graded Lie algebroid. We prove that the space of vector fields on a dg-manifold with homological vector field Q admits a structure of L-infinity algebra with the Lie derivative LQ as unary …
This work provides minimax bounds for structured prediction models.
problem Limited understanding of necessary sample complexity for structured prediction.
method Analysis of factor-graph inference models for structured prediction.
result Characterization of necessary sample complexity for any algorithm.
This paper connects virtual biquandles to biquandles for virtual link colorings.
problem Extending invariants from biquandles to virtual biquandles.
method Establishing equivalence between two representations of virtual braid groups and introducing new labeling rules.
result The number of colorings of a virtual link by virtual biquandles can be recovered from colorings by biquandles.
The aim of this short note is to draw attention to a method by which the partition function and marginal probabilities for a certain class of random fields on complete graphs can be computed in polynomial time. This class includes Ising models with homogeneous pairwise potentials but arbitrary (inhomogeneous) unary pot…
MAP inference for general energy functions remains a challenging problem. While most efforts are channeled towards improving the linear programming (LP) based relaxation, this work is motivated by the quadratic programming (QP) relaxation. We propose a novel MAP relaxation that penalizes the Kullback-Leibler divergence…
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every face of a planar embedding of the graph in order to capture the effect of unary potentials. A ground state of the resulting approximation can…
The paper tackles partial inference in structured prediction using a convex optimization approach.
problem Maximizing a score function with unary and pairwise potentials in graph label spaces.
method Generative model approach with two-stage convex optimization for label recovery.
result Conditions for recovering a majority of labels with provable guarantees.
A neural network with a single hidden layer can't represent certain multivariable functions.
problem Representing certain multivariable functions with a neural network having only one hidden layer.
method Developed a continuum version of a one-hidden-layer neural network with ReLU activation, and proved constraints on its parameters and second derivative.
result Existence of a smooth binary function that cannot be precisely represented by any such neural network.
New resurgent analysis reveals dual q-series for Chern-Simons theory crossing natural boundaries.
problem Understanding crossing natural boundaries in Chern-Simons theory.
method Resurgent analysis and Mordell integrals to identify dual q-series. result Practical numerical algorithm generates dual q-series. New optimization algorithm for mixed-variable problems improves efficiency.
problem Optimizing functions with both continuous and categorical variables.
method Combines radial basis function and metric stochastic response surface methods with modifications for categorical variables and parallel processing.
result Numerical experiments show the effectiveness of the proposed modifications.
The Open University studies student online behavior in virtual learning environments.
problem Improving retention rates in online modules.
method GUHA and Markov chain-based analysis of student activity.
result Both methods are valid for modeling student activities.
Paper tackles high-order inference in structured prediction tasks.
problem Maximizing a score function on the space of labels in high-order Markov random fields.
method Generative model approach with two-stage convex optimization algorithm.
result Success in general high-order inference problems driven by hyperedge expansion properties.
Tackling pattern recognition problems in areas such as computer vision, bioinformatics, speech or text recognition is often done best by taking into account task-specific statistical relations between output variables. In structured prediction, this internal structure is used to predict multiple outputs simultaneously,…
We study the shifted analogue of the "Lie--Poisson" construction for L∞ algebroids and we prove that any L∞ algebroid naturally gives rise to shifted derived Poisson manifolds. We also investigate derived Poisson structures from a purely algebraic perspective and, in particular, we establish a homotopy …
Statistical relational models provide compact encodings of probabilistic dependencies in relational domains, but result in highly intractable graphical models. The goal of lifted inference is to carry out probabilistic inference without needing to reason about each individual separately, by instead treating exchangeabl…
New internal symmetry found for Lie pair algebra.
problem Understanding Lie pair structures and their associated algebras.
method Introduced a Lie algebra action by Der(L) on the L_{≤3} algebra.
result Found internal symmetry of the L_{≤3} algebra.
We consider the quantifier-free languages, Bc and Bc0, obtained by augmenting the signature of Boolean algebras with a unary predicate representing, respectively, the property of being connected, and the property of having a connected interior. These languages are interpreted over the regular closed sets of n-dimension…
We prove that to every inclusion A↪L of Lie algebroids over the same base manifold M corresponds a Kapranov dg-manifold structure on A[1]⊕L/A, which is canonical up to isomorphism. As a consequence, Γ(Λ∙A∨⊗L/A) carries a canonical L∞[1] algebra structure whose una…
New method uses resurgent analysis to determine growth rate of quantum field theory coefficients.
problem Determining the growth rate of quantum field theory coefficients.
method Resurgence analysis on the Stokes line, leading to transseries decomposition and continued across natural boundary.
result Essential exponent of growth has Cardy-like interpretation as effective central charge.
A new method for few-shot learning using Laplacian regularization.
problem Few-shot learning with limited labeled data.
method Transductive Laplacian-regularized inference for feature embeddings.
result Our method outperforms state-of-the-art methods across various benchmarks.
The paper explores connections between dg manifolds and homotopy Lie algebras.
problem Understanding the relationship between dg manifolds and homotopy Lie algebras.
method Study of formal exponential maps, Atiyah classes, and Kapranov L-infinity algebras.
result Existence of formal exponential maps linked to vanishing of Atiyah classes.
Using intersection and self-intersection of loops, Turaev introduced in the seventies two fundamental operations on the algebra Q[π] of the fundamental group π of a surface with boundary. The first operation is binary and measures the intersection of two oriented based curves on the surface, while the seco…
Paper improves basket option pricing for log-normal models.
problem Challenges in pricing basket options with negative weights.
method Moment matching and solving a unary cubic equation.
result Highly accurate closed form solution for basket options.
Fairness constraints improve exact recovery in structured prediction models.
problem Exact recovery of fair binary node labels from noisy observations.
method Analyzed Globerson et al. (2015) model with fairness constraints and improved exact recovery for graphs with poor expansion properties.
result Fairness constraints improve the probability of exact recovery from noisy observations.
Paper accelerates nonlinear mapping in online systems with lower time complexity.
problem Speeding up nonlinear mapping in online systems.
method Integrates an acceleration module into Dendrite Net (DD) to reduce time complexity.
result DD with AC has lower time complexity while maintaining nonlinear mapping and system identification properties.
Researchers created an accurate kinetic energy functional for materials modeling.
problem Lack of accurate analytic kinetic energy functionals for large-scale ab initio materials modeling.
method Interpretative machine learning of crystal cell-averaged kinetic energy densities guided by a hybrid Gaussian process regression - neural network (GPR-NN) method.
result Constructed an analytic kinetic energy functional that reproduces Kohn-Sham DFT energy-volume curves with sufficient accuracy.
Determinantal Point Processes (DPPs) are probabilistic models that arise in quantum physics and random matrix theory and have recently found numerous applications in computer science. DPPs define distributions over subsets of a given ground set, they exhibit interesting properties such as negative correlation, and, unl…
New algebraic structure derived from Kähler manifolds.
problem Understanding algebraic structures on differential forms.
method Introducing L∞[1] R-algebras and proving linearization theorems. result Induced L∞[1] R-algebra structures on Γ(L) are linearizable under certain conditions. Paper presents a new framework for sequence classification.
problem Sequence classification in real-world applications.
method Reference-based sequence classification framework.
result New sequence classification algorithms achieve comparable accuracy.
Dual-stage sEMG classification improves gesture recognition accuracy.
problem Improving accuracy in hand gesture recognition from sEMG signals.
method Dual-stage classification approach: first stage groups similar activities, second stage classifies within groups.
result Dual-stage classification yields significantly higher accuracy than single-stage approach.
A novel method for classification with rejection using ensemble of cost-sensitive classifiers.
problem Avoid risky misclassification in error-critical applications.
method Learning an ensemble of cost-sensitive classifiers.
result Improved classification accuracy and flexibility in loss selection.
The number of possible methods of generalizing binary classification to multi-class classification increases exponentially with the number of class labels. Often, the best method of doing so will be highly problem dependent. Here we present classification software in which the partitioning of multi-class classification…
Few-shot image classification is improved by correcting CNNs' texture bias.
problem Few-shot image classification performance is hindered by CNNs' texture bias.
method Corrected CNNs' texture bias using a simpler method than state-of-the-art approaches.
result State-of-the-art performance on miniImageNet task achieved.
Paper introduces LPCs for robust classification with performance bounds.
problem Conventional classification techniques constrain rules and use surrogate losses.
method Robust risk minimization (RRM) for unconstrained classification rules, optimizing 0-1 loss.
result LPCs provide performance bounds and competitive performance with state-of-the-art techniques.
New NHCAs improve multi-category classification efficiency.
problem Efficient multi-category classification for real-world problems.
method Twin SVM (TWSVM), Generalized eigenvalue proximal SVM (GEPSVM), Regularized GEPSVM (RegGEPSVM), and Improved GEPSVM (IGEPSVM) with OAA, BT, and TDS approaches.
result TDS-TWSVM outperforms other methods in classification accuracy.
Paper compares XGB and BPNN for music style classification.
problem Efficient music style classification using different methods.
method Feature extraction for timbral texture, rhythmic content, and pitch content; comparative evaluation of XGB and BPNN.
result XGB outperforms BPNN for small datasets in music classification.
Deep reinforcement learning improves classification accuracy for imbalanced datasets.
problem Imbalanced datasets challenge conventional classification algorithms.
method Formulated as a sequential decision-making process, solved using deep Q-learning network.
result Proposed model outperforms other imbalanced classification algorithms.
Classification outperforms regression in portfolio construction, yielding higher Sharpe ratios.
problem Determining which machine learning approach (classification vs. regression) is more effective for portfolio construction.
method Used stacking ensemble of gradient boosted tree, random forest, and neural network models.
result Classification yields higher Sharpe ratios and economically significant alphas compared to regression.
C-HMCNN(h) improves HMC classification by leveraging class hierarchy.
problem Hierarchical multi-label classification with class hierarchy constraints.
method Exploits class hierarchy to produce coherent predictions for multi-label classification.
result C-HMCNN(h) outperforms state-of-the-art models in HMC classification.
Advances few-shot classification by treating it as supervised learning and proposing new training techniques.
problem Formulating the ability of humans to learn from limited data in machine learning.
method Formulated few-shot classification as a supervised learning problem and introduced multi-episode and cross-way training techniques.
result Proposed training strategies accelerate the training process without accuracy loss.
Improves NILM with multi-label SRC, outperforming state-of-the-art.
problem Non-intrusive load monitoring (NILM) for energy disaggregation.
method Modified multi-label sparse representation based classification (SRC).
result Significant improvement over state-of-the-art techniques with minimal training data.
New approach improves classification guarantees by focusing on direction rather than regression risk.
problem Improving classification guarantees in binary classification problems.
method Establishing a geometric distinction between classification and regression, leveraging scale invariance.
result Improved guarantees for classification risk compared to regression risk.
Study selective classification with halfspaces, achieving error bounds under Gaussian distributions.
problem Modeling relationships in subsets of data defined by selection rules.
method Sparse linear classifiers for subsets defined by halfspaces, focusing on Gaussian feature distributions.
result First PAC-learning algorithm for homogeneous halfspace selectors with error guarantee $\bigO*{\sqrt{\mathrm{opt}}}$.