Telecomunicaciones, información y comunicación

An Optimal Algorithm for Changing from Latitudinal to Longitudinal Formation of Autonomous Aircraft Squadrons
- This work presents an algorithm for changing from latitudinal to longitudinal formation of autonomous aircraft squadrons. The maneuvers are defined dynamically by using a predefined set of 3D basic...
A binarized-domains arc-consistency algorithm for TCSPs: its computational analysis and its use as a filtering procedure in solution search algorithms
- TCSPs (Temporal Constraint Satisfaction Problems) [Dechter et al. 1991] get rid of unary constraints by binarizing them after having added an "origin of the world" variable. In this work, we...
Ensemble Learning Based Classification Algorithm Recommendation
- Selecting an appropriate classification algorithm for a given data set remains a challenging problem in data mining and machine learning. Existing algorithm recommendation models are typically...
MeloDISinger: Melody-Aware & Duration-Preserving Singing Voice Editing with Audio Infilling
- Text-based singing voice editing (SVE) aims to revise sung lyrics while preserving the original melody, total duration, and non-edited regions. In this paper, we propose MeloDISinger, a...
Why can genetic algorithms work in high-dimensional search spaces?
- We show that the effective dynamics of the elitist $(1+M)$ genetic algorithm is, in the limit of small mutations, clipped gradient descent on the loss in the presence of anisotropic Gaussian white...
Optimization Dynamics Imprint Semantic Specificity in Contrastive Embedding Norms
- Contrastive embedding models trained with scale-invariant losses are typically paired with distance metrics like cosine similarity, effectively ignoring embedding magnitudes. However, surprisingly,...
Authentication in Quantum Networks
- In this review, we survey the cryptographic task of authentication from the perspective of quantum communication. We review three main flavours of authentication that are often conflated in the...
Staged Hybridisation for Visual Quantum Reinforcement Learning via Knowledge Distillation
- Visual environments are a demanding setting for quantum reinforcement learning (QRL): high-dimensional observations, unstable RL optimisation, and constrained variational quantum circuits (VQCs) are...
Working with measurement-based computations on qudits
- Measurement-based quantum computing is a universal model of quantum computation in which successive product measurements of an entangled resource state drive the computation. The non-deterministic...
Bridging the NISQ and Fault-Tolerant Regimes: Generative-ML-Assisted Quantum Selected CI for Molecular Simulations
- Calculation of binding energies for protein-ligand molecular systems requires accurate treatment of the electronic structure, a quantum chemistry problem that scales exponentially on classical...
Factorizable Normalizing Flows for parameter-dependent density morphing
- Normalizing Flows excel at modeling a single fixed density, yet many problems across the sciences, such as high energy physics, instead require modeling how that density deforms as a function of...
Computing sieve integrals using LattE, and the density of integers with a localized divisor
- We consider the problem of estimating numerically integrals of the shape $$ \int_P \frac{dt}{t_1 \dotsb t_k} $$ where $P \in {\mathbb R}_{>0}^k$ is a convex polytope, $t=(t_1,\dotsc, t_k)$ and $d t$...
SGD Provably Prioritizes a Shortcut Spurious Feature in the XOR Model
- Neural networks are known to be susceptible to over-reliance on spurious correlations. However, the precise mechanism by which models exploit shortcut features is not fully understood, and algorithms...
Collective cooperation without individual fidelity in LLM agents
- Large language models (LLMs) are increasingly used as agents in simulations of social systems, yet it remains unclear when their behavior can be interpreted as a faithful proxy for human...
Non-parametric recovery of causal diffusion mechanisms from steady-state observations
- We consider sparse multivariate stochastic systems that evolve in continuous time according to a causal mechanism and present methodology to recover the system's time-infinitesimal transition...
Learning the structure of open quantum systems
- We design an algorithm for learning the coefficients of an $n$-qubit constant-local Lindbladian to $\varepsilon$ error with $O(g d^2 \log(n) / \varepsilon^2)$ total evolution time, where $g$ is the...
A Stochastic--Geometric Theory of Scaling Laws in Grokking
- Delayed generalization (\ie~grokking) refers to the phenomenon in which a neural network fits its training data early in training but only begins to generalize after a prolonged delay, often through...
List $3$-coloring $C_4$-free graphs of diameter-$2$ in polynomial-time
- We show that list $3$-coloring a~$C_4$-free graph of diameter-$2$ can be done in polynomial-time. Our algorithm is based on a structural characterization showing that many such graphs are...
Extrapolating from Regularised Solutions for Solving Ill-Conditioned Linear Systems in Machine Learning
- Rapid prototyping of algorithms is a critical step in modern machine learning. Most algorithms exploit linear algebra, creating a need for lightweight numerical routines which -- while potentially...
Robust secret storage in networks
- The problem of storing secure information on a network is studied. A formal framework for distributed secret storage is introduced, and possible applications in technological and social systems are...
Quantum Lazy Sampling and Path Recording for Any Group
- A central challenge in quantum algorithms and cryptography is reasoning about algorithms with oracle access to a random group element (e.g. a random function, permutation, or unitary). Can we...