LARCA - Laboratori d'Algorísmia Relacional, Complexitat i Aprenentatge

 

LARCA és un grup de recerca de nivell internacional en temes d'aprenentatge i mineria de dades, anàlisi de dades i lingüística matemàtica. Típicament, abordem els problemes des de principis matemàtics sòlids, usant eines de modelització i tècniques de l'algorísmia, complexitat computacional, teoria d'autòmats, lògica, matemàtica discreta, estadística, i sistemes dinàmics. Estem iniciant
col·laboracions amb empreses i altres institucions per tal d'aplicar les nostres solucions al problemes del món real.

LARCA es un grupo de investigación de nivel internacional en temas de aprendizaje y minería de datos, análisis de datos y lingüística matemática. Típicamente, abordamos los problemas desde principios matemáticos sólidos, usando técnicas de modelización de la algoritmia, la complejidad computacional, teoría de autómatas, lógica, matemática discreta, estadística y sistemas dinámicos. Estamos iniciando colaboraciones con empresas e instituciones para la aplicación de nuestras soluciones a contextos reales.

LARCA is an international research group working on data mining, machine learning, data analysis, and mathematical linguistics. We typically approach problems from sound mathematical principles, using modelling tools and techniques from algorithmics, computational complexity, automata theory, logic, discrete mathematics, statistics, and dynamic systems. We are also starting partnerships with companies and other institutions to apply our solutions to real-world problems.

LARCA is an international research group working on data mining, machine learning, data analysis, and mathematical linguistics. We typically approach problems from sound mathematical principles, using modelling tools and techniques from algorithmics, computational complexity, automata theory, logic, discrete mathematics, statistics, and dynamic systems. We are also starting partnerships with companies and other institutions to apply our solutions to real-world problems.

Recent Submissions

  • Linguistic laws in speech: the case of Catalan and Spanish 

    Hernández Fernández, Antonio; González Torre, Iván; Garrido, Juan Maria; Lacasa, Lucas (2019-11-26)
    Article
    Open Access
    In this work we consider Glissando Corpus—an oral corpus of Catalan and Spanish—and empirically analyze the presence of the four classical linguistic laws (Zipf’s law, Herdan’s law, Brevity law, and Menzerath–Altmann’s ...

  • On the physical origin of linguistic laws and lognormality in speech 

    González Torre, Iván; Luque Serrano, Bartolome; Lacasa, Lucas; Kello, Christopher; Hernández Fernández, Antonio (2019-08-21)
    Article
    Open Access
    Physical manifestations of linguistic units include sources of variability due to factors of speech production which are by definition excluded from counts of linguistic symbols. In this work, we examine whether linguistic ...

  • On the efficacy of stop-loss rules in the presence of overnight gaps 

    Arratia Quesada, Argimiro Alejandro; Dorador Chalar, Albert (2019-04-30)
    Article
    Restricted access - publisher's policy
    A stop-loss rule is a risk management tool whereby the investor predefines some condition that, upon being triggered by market dynamics, implies the liquidation of her outstanding position. Such a tool is widely used by ...

  • Anti dependency distance minimization in short sequences: A graph theoretic approach 

    Ferrer Cancho, Ramon; Gómez Rodríguez, Carlos (Informa UK (Taylor & Francis), 2019-08-22)
    Article
    Restricted access - publisher's policy
    Dependency distance minimization (DDm) is a word order principle favouring the placement of syntactically related words close to each other in sentences. Massive evidence of the principle has been reported for more than a ...

  • Polysemy and brevity versus frequency in language 

    Casas Fernández, Bernardino; Hernández Fernández, Antonio; Catala Roig, Neus; Ferrer Cancho, Ramon; Baixeries i Juvillà, Jaume (Elsevier, 2019-11-01)
    Article
    Open Access
    The pioneering research of G. K. Zipf on the relationship between word frequency and other word features led to the formulation of various linguistic laws. The most popular is Zipf’s law for word frequencies. Here we focus ...

  • The sum of edge lengths in random linear arrangements 

    Ferrer Cancho, Ramon (Institute of Physics (IOP), 2019-05-09)
    Article
    Restricted access - publisher's policy
    Spatial networks are networks where nodes are located in a space equipped with a metric. Typically, the space is two-dimensional and until recently and traditionally, the metric that was usually considered was the Euclidean ...

  • Relative entailment among probabilistic implications 

    Atserias, Albert; Balcázar Navarro, José Luis; Piceno Cabrera, Marie Ely (2019-02-06)
    Article
    Open Access
    We study a natural variant of the implicational fragment of propositional logic. Its formulas are pairs of conjunctions of positive literals, related together by an implicational-like connective; the semantics of this sort ...

  • Weighted contrastive divergence 

    Romero Merino, Enrique; Mazzanti Castrillejo, Fernando Pablo; Delgado Pin, Jordi; Buchaca Prats, David (2019-06)
    Article
    Restricted access - publisher's policy
    Learning algorithms for energy based Boltzmann architectures that rely on gradient descent are in general computationally prohibitive, typically due to the exponential number of terms involved in computing the partition ...

  • American and exotic options in a market with frictions 

    Junike, Gero; Arratia Quesada, Argimiro Alejandro; Cabaña Nigro, Ana Alejandra; Schoutens, Wim (2019-04-01)
    Article
    Restricted access - publisher's policy
    In a market with frictions, bid and ask prices are described by sublinear pricing functionals, which can be defined recursively using coherent risk measures. We prove the convergence of bid and ask prices for various ...

  • Averaging operators on decreasing or positive functions: equivalence and optimal bounds 

    Boza Rocho, Santiago; Soria de Diego, Javier (Elsevier, 2019-01-01)
    Article
    Restricted access - publisher's policy
    We study the optimal bounds for the Hardy operator S minus the identity, as well as S and its dualoperator S*, on the full range 1 = p = 8, for the cases of decreasing, positive or general functions (infact, these two kinds ...

  • Linguistic laws in chimpanzee gestural communication 

    Heesen, Raphaela; Hobaiter, Catherine; Ferrer Cancho, Ramon; Semple, Stuart (2019-02-13)
    Article
    Open Access
    Studies testing linguistic laws outside language have provided important insights into the organization of biological systems. For example, patterns consistent with Zipf's law of abbreviation (which predicts a negative ...

  • The polysemy of the words that children learn over time 

    Casas Fernández, Bernardino; Catala Roig, Neus; Ferrer Cancho, Ramon; Hernández Fernández, Antonio; Baixeries i Juvillà, Jaume (2018-12)
    Article
    Open Access
    Here we study polysemy as a potential learning bias in vocabulary learning in children. We employ a massive set of transcriptions of conversations between children and adults in English, to analyze the evolution of mean ...

View more