The paper discusses colorings and doubled colorings of virtual doodles.
problem Coloring virtual doodles using a new algebraic structure.
method Introduced a new algebra called a doodle switch and defined an invariant for virtual doodles.
result Introduced doubled colorings and defined an invariant for virtual doodles.
Classifies doodles into prime and super prime types, describing them with doodle codes.
problem Classifying doodles into prime and super prime types.
method Using doodle codes to describe complementary regions and enumerate doodle diagrams.
result Super prime doodles have a Hamiltonian circuit.
Alexander invariant created for doodles, vanishes on unlinked doodles.
problem Creating an Alexander type invariant for doodles.
method Deformation of Tits representation and Chebyshev polynomials of second kind.
result Invariant vanishes on unlinked doodles with more than one component.
Doodles were introduced in [R. Fenn and P. Taylor, Introducing doodles, Topology of low-dimensional manifolds, pp. 37--43, Lecture Notes in Math., 722, Springer, Berlin, 1979] but were restricted to embedded circles in the 2-sphere. Khovanov, [M. Khovanov, Doodle groups, Trans. Amer. Math. Soc. 349 (1997), 2297--2315],…
Doodles link to commutator identities in a 2-sphere.
problem Understanding commutator identities in free groups via doodles.
method Analyzing doodles with proper noose systems and establishing bijections.
result A bijection between doodles and commutator identities.
Paper introduces skew-symmetric matrices for virtual doodle classification.
problem Classifying virtual doodles and distinguishing non-classical doodles.
method Use skew-symmetric augmented matrices and homology intersection number.
result Characterization of virtualization of classical doodles.
Complete invariant defined for doodles on a sphere.
problem Doodles on a 2-sphere.
method Coefficients in series of chord diagrams.
result Finite type invariants of order at most 2n.
New theorem for doodles on sphere, similar to Markov's.
problem Understanding doodles on a sphere.
method Description of twins with equivalent closures.
result Analogous to Markov's theorem for doodles.
We discuss Gauss codes of virtual diagrams and virtual doodles. The notion of a left canonical Gauss code is introduced and it is shown that oriented virtual doodles are uniquely presented by left canonical Gauss codes.
Cactus doodles are geometric objects derived from cactus groups.
problem Understanding geometric structures related to algebraic groups.
method Defining cactus doodles via local moves on plane curves and relating them to cactus groups.
result Established properties of cactus doodles and their connection to cactus groups.
Paper defines doodles on closed surfaces, unifying classical and virtual theories.
problem Classifying doodles on closed surfaces, especially non-orientable ones.
method Introducing twisted virtual doodles, defining twin groups, and proving Alexander- and Markov-type theorems.
result Unified theory of doodles, showing trivial center and residually finite properties.
Paper shows how to represent Milnor's triple linking number using chord diagrams and doodle invariants.
problem Tackles the representation of Milnor's triple linking number.
method Establishes an analogous description for Milnor's triple linking number using counts of chord diagrams and doodle invariants.
result Shows that Milnor's triple linking number can be represented in terms of chord diagrams and doodle invariants.
Computes invariants distinguishing between immersions and embeddings of doodles and blobs on surfaces.
problem Distinguishing between immersions and embeddings of doodles and blobs on surfaces.
method Regular embeddings, bordisms, and exact sequences of abelian groups.
result Exact sequence describing bordisms of immersions and embeddings of doodles on A=RimesI. Users create melodies with AI, harmonized in the style of Bach.
problem Making music composition accessible to non-experts.
method Simplified interface, machine learning model Coconet, optimized for web.
result Users spent 350 years worth of time playing with the Bach Doodle.
DOODL learns shared spectral dynamics across related dynamical systems.
problem Learning independent dynamical operators for each system limits discovery of shared structure.
method DOODL learns a dictionary of characteristic spectral dynamics on a manifold of related systems.
result DOODL achieves errors one to two orders of magnitude lower than independent operator estimation methods.
The paper classifies 10 antipodal pairings of self-dual maps.
problem Understanding the antipodal pairings of strongly involutive polyhedra.
method Classification of self-dual pairings and construction of polyhedra.
result Determination of 10 antipodal pairings among 24 self-dual pairings.
Proves Alexander and Markov theorems for higher genus virtual doodles.
problem Classifying isotopy classes of immersed circles on surfaces.
method Introduces virtual twin groups to extend twin groups and prove theorems for higher genus.
result Proves Alexander and Markov theorems for higher genus virtual doodles.
Given a plane curve γ:S1→R2, we consider the problem of determining the minimal number I(γ) of inflections which curves $\mbox{diff}(γ)$ may have, where $\mbox{diff}$ runs over the group of diffeomorphisms of R2. We show that if γ is an immersed curve with D(γ) double points and no othe…
New algorithm reduces switching costs in multinomial logit bandit problems.
problem Minimizing switching costs in multinomial logit bandit problems.
method Proposed AT-DUCB and FH-DUCB algorithms with low assortment switching costs.
result AT-DUCB and FH-DUCB algorithms achieve almost optimal minimax regret with low switching costs.
New polynomial invariants derived from birack and switch structures.
problem Polynomial invariants of braids.
method Switch structures, birack colorings, quiver-valued invariants.
result New polynomial invariants of braids.
In this paper, we study optimal switching problems under ambiguity. To characterize the optimal switching under ambiguity in the finite horizon, we use multidimensional reflected backward stochastic differential equations (multidimensional RBSDEs) and show that a value function of the optimal switching under ambiguity …
Survey reviews code-switched speech and language processing.
problem Processing code-switched text and speech for multilingual communities.
method Reviews computational approaches and lists available resources.
result Essential for building intelligent agents that interact in multilingual settings.
This work extends identifiability analysis to sequential latent variable models, focusing on Switching Dynamical Systems.
problem Identifying latent variables in sequential data models.
method Proved identifiability of Markov Switching Models and established conditions for Switching Dynamical Systems.
result Identifiability of latent variables and non-linear mappings in Switching Dynamical Systems up to affine transformations.
The problem of optimal switching between nonlinear autonomous subsystems is investigated in this study where the objective is not only bringing the states to close to the desired point, but also adjusting the switching pattern, in the sense of penalizing switching occurrences and assigning different preferences to util…
Study on revenue management with limited switches, achieving strong performance and reduced switch counts.
problem Resource-constrained dynamic pricing with limited switching constraints.
method Developed algorithms for blind network revenue management and bandits with knapsacks, achieving optimal regret rates.
result Optimal regret rates are fully characterized by a piecewise-constant function of the switching budget and resource constraints.
New algorithms improve sampling from complex distributions.
problem Sampling from complex probability distributions efficiently.
method Regime-switching Langevin dynamics and Monte Carlo algorithms.
result Convergence guarantees and iteration complexities provided.
Squirrel switches between optimizers for better performance.
problem Finding the best optimizer for a given problem.
method Switches between different optimizers based on performance.
result Improves performance on various problems.
Study approximates financial market with discrete-time models.
problem Approximating continuous-time financial market models with discrete-time.
method Constructs discrete-time market models with Markov switching and proves convergence.
result Discrete-time models converge to continuous-time Black-Scholes model with Markov switching.
Optimizes control of hybrid systems with multiple switching processes.
problem Optimal control of hybrid systems with multiple Markov switching processes.
method Combines two separate Markov chains into one synthetic chain, derives HJB equations, and solves the portfolio choice problem.
result Derives explicit solutions and value functions for the optimal control problem.
Study tackles balancing policy switching costs in offline RL.
problem Balancing the cost of policy switching in offline RL.
method Optimal transport ideas and Net Actor-Critic algorithm.
result Demonstrated efficiency on multiple RL benchmarks.
New algorithm learns switching dynamics from multiple neural signals.
problem Learning accurate switching dynamical system models from multimodal neural data.
method Unsupervised learning algorithm for multiscale switching dynamical system models.
result Switching multiscale dynamical system models outperform single-scale models in behavior decoding.
Paper tackles utility maximization with job-switching and retirement constraints.
problem Maximizing utility with job-switching and retirement constraints.
method Dual-martingale approach and double obstacle problem theory.
result Characterization of optimal job-switching strategy and wealth boundaries.
Solves label switching in mixture models using optimal transport.
problem Label switching in mixture model posterior inference prevents meaningful statistics assessment.
method Proposes an algorithm leveraging optimal transport to compute posterior statistics in a quotient space.
result Demonstrates advantages over alternative approaches on simulated and real data.
New RL algorithm reduces policy switching cost to loglog(T) with similar regret.
problem Low policy switching cost in real-life RL applications.
method Stage-wise exploration and adaptive policy elimination.
result Regret of O(HSAloglogT) with O(HSAloglogT) switching cost. The paper explores dynamic regret with switching cost in online decision making.
problem The relation between dynamic regret and switching cost in online decision making.
method Investigates two classic online settings: Online Algorithms (OA) and Online Convex Optimization (OCO). Provides a new theoretical analysis framework.
result The switching cost impacts dynamic regret differently in OA and has no impact in OCO.
Developed a new statistic to test binary regime switching models.
problem Testing the model assumption of binary regime switching extension of GBM.
method Proposed a new discriminating statistics and identified an admissible class of regime switching candidate models.
result Sampling distribution of the test statistics differs significantly between different regime switching models.
A new network learns market conditions and predicts stock performance.
problem Optimizing stock portfolio performance in the US equities market.
method Residual Switching Network combining two ResNets: a switching module and a main module.
result The residual switching network strategy outperformed other models with an average annual Sharpe ratio of 2.22.
Paper analyzes minimax regret in constrained online convex optimization with limited switching opportunities.
problem Minimizing regret in online convex optimization with limited switching opportunities.
method Introduced fugal game relaxation and mini-batching algorithm to establish minimax regret bounds.
result Minimax regret of switching-constrained OCO is Θ(T / √K).
Paper presents an efficient algorithm for linear MDP with low switching cost.
problem Large state space reinforcement learning problems with low switching cost.
method First algorithm for linear MDP with low switching cost, achieving near-optimal regret and switching cost.
result Regret bound of $\widetilde{O}\left(\sqrt{d^3H^4K}
ight)$ and near-optimal switching cost of $O\left(d H\log K
ight)$.
Solves risk-aware optimal switching problems in discrete time.
problem Non-Markovian optimal switching problems with risk awareness and general filtration.
method Solves reflected backward stochastic difference equations.
result Existence and uniqueness of solutions for the problems.
Study online learning with feedback graphs and switching costs, providing algorithms and optimal regret bounds.
problem Online learning with partial feedback and switching costs.
method Analysis of feedback graphs, lower bound on expected regret, new algorithms (Threshold Based EXP3, EXP3. SC).
result Order optimal algorithms for specific cases and Threshold Based EXP3 outperforms in empirical evaluations.
Study strategic competition in commodity markets using impulse-switching controls.
problem Strategic competition between upstream and downstream firms in commodity markets.
method Non-zero-sum stochastic differential game with mixed impulse/switching controls.
result Multiple Nash equilibria found, depending on the number of switches by the downstream firm.
One type of switch simplifies operations on lattice knots.
problem Operations on lattice knots are complex.
method Reduced operations to one type of local switch.
result Simplified set of operations on lattice knots.
Optimal switching regret for all segmentations in online convex optimisation.
problem Non-stationary online convex optimisation problems.
method Developed an efficient algorithm to achieve optimal switching regret on every possible segmentation.
result Achieved asymptotically optimal switching regret on every possible segmentation simultaneously.
The paper optimizes utility for switching models using Lévy processes.
problem Maximizing HARA utilities in Lévy switching models.
method Dual method, f-divergence minimal martingale measures, Hellinger and Kulback-Leibler processes.
result Expressions for optimal strategies and maximal expected utilities.
New Q-Learning algorithm reduces switching cost in MDPs.
problem Reducing adaptivity in real-world applications.
method Q-Learning with UCB2 exploration, quantified by local switching cost.
result Achieves sublinear regret with low switching cost.
This paper tackles near-optimal adversarial RL with switching costs, providing algorithms and matching lower bounds.
problem Adversarial RL with switching costs, where loss distribution can be non-stationary or adversarial.
method Developed novel switching-reduced algorithms with matching lower bounds for known and unknown transition functions.
result Achieved near-optimal performance in adversarial RL with switching costs, matching theoretical lower bounds.
The paper provides guarantees for learning switching non-linear systems from a single trajectory.
problem Learning non-linear dynamical systems with switching dynamics.
method Non-asymptotic bounds derived under stability assumptions for i.i.d. switching modes.
result Explicit convergence rates for Hölder and linear function classes based on effective sample size.