The paper evaluates classic tri-training methods for neural semi-supervised learning under domain shift.
problem Difficulty in comparing neural models for domain shift learning.
method Proposes a novel multi-task tri-training method to reduce complexity.
result Classic tri-training with additions outperforms state-of-the-art methods.
Paper improves sound event detection using semi-supervised learning.
problem Weakly labeled sound event detection in polyphonic audio clips.
method Combines tri-training and adversarial learning for semi-supervised learning.
result Significant performance improvement over baseline model.
New method improves text classification without labeled target data.
problem Improving text classification under domain shift without labeled target data.
method Diversity-based generalization using multi-head attention with diversity constraints.
result Method matches state-of-the-art performance without labeled target data.
Proposes a meta-learning method to improve recommender systems with biased feedback.
problem Learning from biased feedback in recommender systems.
method Asymmetric tri-training framework for meta-learning, using three predictors.
result Minimizes the upper bound of true performance metric, improving robustness to selection bias.
The paper identifies three types of classic texts in megaproject management.
problem Does megaproject management have classic texts?
method Identifying and categorizing three types of classic texts: conventional, Kuhnian, and citation classics.
result Citation classics exist and perform well compared to other management literature.
Virtual and welded periods of knots are equivalent to classical periods.
problem Understanding the equivalence of virtual and welded periods to classical periods.
method Direct demonstration of equivalence.
result Classical knots have only finitely many virtual or welded periods.
Classical knots embed into virtual knots' concordance group.
problem Understanding concordance of virtual knots.
method Proved equivalence between classical and virtual sliceness.
result Embedding of classical knots' concordance group into virtual knots.
Classical knot recognition problem solved in NP with exponential time algorithm.
problem Determining if a virtual knot is classical.
method Proved NP membership and provided an exponential time algorithm.
result Classical knot recognition problem is in NP.
Instantons on ALE spaces described for classical groups.
problem Instantons on ALE spaces for classical groups.
method ADHM type description extension of unitary groups.
result Description of instantons on ALE spaces for classical groups.
Classical scaling is shown to be optimal under various noisy conditions.
problem Consistency of classical scaling under general noise conditions.
method Established using finite fourth moments of noise, derived convergence rates, and matching minimax lower bounds.
result Classical scaling achieves minimax optimality in recovering true configuration from noisy dissimilarities.
This paper compares classical shadows and direct quantum measurement for efficient information extraction.
problem Efficiently extracting classical information from quantum states with limited classical post-processing.
method Quantitative resource analysis comparing classical shadows and direct quantum measurement.
result An efficiency frontier between classical shadows and direct quantum measurement is identified.
Quantum models simulate classical channels more efficiently, improving transmission rates.
problem Optimizing quantum models to simulate classical channels more efficiently.
method Examining when and how well quantum simulations of classical channels improve upon classical simulations.
result Quantum simulations can improve upon classical simulation rates.
Quantum oracles help identify counterfactuals better than classical ones.
problem Identifying unknown causal parameters in causal models.
method Using quantum oracles to query and identify all causal parameters and counterfactuals.
result Quantum oracles enable identification of all two-way joint counterfactuals and tighter bounds on higher-order counterfactuals.
Lecture notes on math methods for classical physics.
problem No specific problem stated; covers classical physics methods.
method Mathematical methods in Lagrangian, Hamiltonian, and field theories.
result Comprehensive coverage of classical physics theories.
Classical clients can verify quantum learning tasks efficiently.
problem Making quantum learning accessible to classical clients.
method Developed a framework for classical verification of quantum learning.
result Quantum learning tasks can be efficiently verified by classical verifiers.
Study on non-classical generating sets in Fuchsian Schottky groups.
problem Estimating non-classical Schottky structure in discrete subgroups.
method Investigated Fuchsian Schottky groups with non-classical generating sets using Möbius transformations.
result Derived two non-trivial examples of Fuchsian Schottky groups with non-classical generating sets.
Survey of various non-classical knot theories from geometric and algebraic perspectives.
problem Various modifications to classical knot theory.
method Comparative geometric and algebraic analysis of non-classical knot theories.
result Distinct topological and combinatorial features in generalized knot theories.
Study compares quantum and classical ML in crypto trading, finding hybrid models outperform.
problem Comparing quantum and classical machine learning in crypto trading strategies.
method Backtesting 10 models across multiple crypto assets using classical ML, quantum ML, hybrid models, and transformer models.
result Hybrid quantum models achieve superior performance with 13.99% return and 1.76 Sharpe ratio.
This work shows how to efficiently simulate parts of quantum landscapes using classical computers.
problem Identifying where quantum computers are advantageous and offloading computations.
method Developed a quantum-enhanced classical algorithm to simulate sub-regions of quantum landscapes.
result It is possible to generate a classical surrogate of a sub-region of a quantum landscape.
Study analyzes 3,171 stocks to pick efficient portfolios using quantum and classical solvers.
problem Creating efficient stock portfolios from a large dataset.
method Used classical and quantum solvers to optimize portfolios of 3,171 US stocks.
result Demonstrated the effectiveness of quantum and classical solvers in portfolio optimization.
The paper studies how geometric transformations affect semi-classical operators on specific Lie groups.
problem Analyzing the effects of diffeomorphisms on semi-classical pseudodifferential operators.
method Examined the pull-back of semi-classical pseudodifferential operators by diffeomorphisms preserving the filtration.
result The pull-back of a semi-classical pseudodifferential operator by a Pansu differentiable diffeomorphism has a semi-classical symbol that is expressed in terms of the Pansu differential.
Classical and welded knot moves are classified and their interrelationships discussed.
problem Classical and welded knot moves and their interrelationships.
method Algebraic classification and topological interpretations of local moves.
result All local moves are unknotting operations for welded knots.
We construct various functorial maps (projections) from virtual knots to classical knots. These maps are defined on diagrams of virtual knots; in terms of Gauss diagram each of them can be represented as a deletion of some chords. The construction relies upon the notion of parity. As corollaries, we prove that the mini…
Generalizes meander diagrams to virtual knots and introduces new invariants.
problem Classifying and comparing virtual knots.
method Generalization of meander diagrams to virtual knots, introduction of virtual k-arc crossing numbers. result Classes of meander and semimeander diagrams are universal for virtual knots.
New link invariants derived from crossing multiplexing.
problem Creating new link invariants from classical to virtual links.
method Multiplexing crossings to create new virtual link diagrams.
result New link invariants derived from known welded link invariants.
Not all Schottky groups of Moebius transformations are classical Schottky groups. In this paper we show that all Fuchsian Schottky groups are classical Schottky groups, but not necessarily on the same set of generators.
A classical link in 3-space can be represented by a Gauss paragraph encoding a link diagram in a combinatorial way. A Gauss paragraph may code not a classical link diagram, but a diagram with virtual crossings. We present a criterion and a linear algorithm detecting whether a Gauss paragraph encodes a classical link. W…
Using a supergeometric interpretation of field functionals, we show that for a class of classical field models used for realistic quantum field theoretic models, an infinite-dimensional supermanifold (smf) of classical solutions in Minkowski space can be constructed. That is, we show that the smf of smooth Cauchy data …
A graphical calculus for microformal morphisms simplifies complex operations in classical and quantum physics.
problem Simplifying operations in classical and quantum microformal morphisms.
method Developed a graphical calculus inspired by Cattaneo-Dherin-Felder's work on formal symplectic groupoids, extended to quantum thick morphisms.
result Infinite series can be written as sums over bipartite trees for both classical and quantum thick morphisms.
This work proposes efficient classical training protocols for IQP circuits to train quantum generative models.
problem Training quantum generative models on industrially relevant probability distributions is challenging due to high computational cost.
method Developed protocols for classical training of IQP circuits, which are hard to sample but have efficient gradient computation.
result Classically trained IQP circuits can efficiently sample from target probability distributions, demonstrating practical quantum advantage.
Quantum computers outperform classical methods in density modeling.
problem Density modeling with quantum computers.
method Quantum-classical separation for density modeling.
result Quantum computers offer a super-polynomial advantage over classical algorithms for density modeling.
We show that if a classical knot diagram satisfies a certain combinatorial condition then it is minimal with respect to the number of classical crossings. This statement is proved by using the Kauffman bracket and the construction of atoms and knots.
We prove an upper bound for the evaluation of all classical SU(2) spin networks conjectured by Garoufalidis and van der Veen. This implies one half of the analogue of the volume conjecture which they proposed for classical spin networks. We are also able to obtain the other half, namely, an exact determination of the s…
Paper studies spectral measures of semi-classical Toeplitz operators.
problem Understanding spectral properties of semi-classical Toeplitz operators.
method Asymptotic expansion in powers of ℏ for spectral measure μℏ. result Asymptotic expansion of spectral measure for semi-classical Toeplitz operators.
The paper explores non-classical Schottky groups and their properties.
problem Characterizing and understanding non-classical Schottky groups.
method Theoretical construction and analysis of infinite collections of Schottky groups.
result Construction of non-classical Schottky groups and examples.
Non-classical virtual knots may have non-isomorphic upper and lower quandles. We exploit this property to define the quandle difference invariant, which can detect non-classicality by comparing the numbers of homomorphisms into a finite quandle from a virtual knot's upper and lower quandles. The invariants for small-or…
Diffeologies unify infinite-dimensional geometry and PDEs, enhancing classical function spaces.
problem Combining infinite-dimensional geometry and PDEs for optimization problems.
method Review and extension of classical function spaces and mapping spaces.
result Diffeologies provide a unified framework for evolution equations and optimization problems.
This paper introduces a new method to create mod m almost classical links from virtual knots.
problem Creating mod m almost classical links from virtual knots.
method Using knots in S_g × S^1 to construct m-fold coverings.
result A new family of m-fold coverings over virtual knots are mod m almost classical.
Quantum machine learning aims to speed up classical algorithms.
problem Speeding up classical machine learning algorithms using quantum computing.
method Review and discussion of quantum machine learning techniques.
result Quantum algorithms offer advantages for certain learning problems.
Proves existence of classical Neumann problems for Hessian equations in uniformly convex domains.
problem Existence of solutions to Neumann problems for Hessian equations.
method Proving existence through uniformly convex domains and Alexandrov-Fenchel inequalities.
result Existence of classical Neumann problems for Hessian equations in uniformly convex domains.
Adversarial quantum-classical model learns and infers data faster.
problem Training quantum circuits is harder than classical neural networks.
method Coupling quantum generator with classical discriminator for training.
result Quantum circuit can infer missing data with quadratic speed up.
Improves diffusion model performance and efficiency through classical search.
problem Tackles inference-time control in diffusion models.
method Proposes a framework combining local and global search for efficient navigation.
result Significant gains in performance and efficiency across various domains.
Classic braids embed in virtual braids.
problem Embedding classic braids in virtual braids.
method Elementary proof using generalizations of braid groups.
result Classical braid group injects into virtual braid group.
We obtain the semi-classical expansion of the kernels and traces of Toeplitz operators with $\cC^k$--\,symbol on a symplectic manifold. We also give a semi-classical estimate of the distance of a Toeplitz operator to the space of self-adjoint and multiplication operators.
Using a supergeometric interpretation of field functionals developed in previous papers, we show that for quite a large class of systems of nonlinear field equations with anticommuting fields, infinite-dimensional supermanifolds (smf) of classical solutions can be constructed. Such systems arise in classical field mode…
This paper establishes a correspondence between biquandle and quandle colorings for classical and surface links.
problem Finding refined invariants for classical and surface links using biquandles.
method Explicit one-to-one correspondence between biquandle colorings and quandle colorings.
result Biquandle homotopy invariants and quandle homotopy invariants are equivalent.
Enhances groups and constructs new invariants of classical braids.
problem Classical braids and their invariants.
method Constructs new invariants valued in GN2 groups. result Identity problem solved in Gn2 groups. In this paper the notion of Tulczyjew's triples in classical mechanics is extended to classical field theories, using the so-called multisymplectic formalism, and a convenient notion of lagrangian submanifold in multisymplectic geometry. Accordingly, the dynamical equations are interpreted as the local equations defini…