arXiv.org e-Print Archive

arXiv.org e-Print Archive
Not a member yet
    623509 research outputs found

    Setting the stage: Building and maintaining a habitable world and the early conditions that could favor life\u27s beginnings on Earth and beyond

    Get PDF
    The Hadean, once thought to be uninhabitable and tumultuous, has more recently been recontextualized as a clement time in which oceans, land, and life likely appeared on Earth. This non-exhaustive chapter follows multiple threads from planet formation to the origin of life. We place significant emphasis on the solar system context for the Earth, the timing and nature of crustal formation and the evolution of the surface and atmosphere. Several scenarios for prebiotic chemistry are also discussed including atmospheric photochemistry, wet-dry and freeze-thaw cycles, and hydrothermal vent systems. We attempt to draw connections between the large-scale, planetary processes and various origin of life pathways to illustrate possible overlaps and correlations. In detail, we conclude with and discuss the impact of impacts to show how asteroid and comet impacts during the Hadean may have affected many of these processes and scenarios, from generating land to altering the chemical composition and oxidation state of the early Earth\u27s atmosphere and surface.18 pages, 5 figures, accepted for publication in The Archean Earth (ed.: M. Homan, P. Mason, R. Ernst, T. Lyons, C. Heubeck, D. Papineau, E. Stueeken, R. Mazumder, A. Webb, W. Altermann), Elsevie

    On the Optimality of Dilated Entropy and Lower Bounds for Online Learning in Extensive-Form Games

    Get PDF
    First-order methods (FOMs) are arguably the most scalable algorithms for equilibrium computation in large extensive-form games. To operationalize these methods, a distance-generating function, acting as a regularizer for the strategy space, must be chosen. The ratio between the strong convexity modulus and the diameter of the regularizer is a key parameter in the analysis of FOMs. A natural question is then: what is the optimal distance-generating function for extensive-form decision spaces? In this paper, we make a number of contributions, ultimately establishing that the weight-one dilated entropy (DilEnt) distance-generating function is optimal up to logarithmic factors. The DilEnt regularizer is notable due to its iterate-equivalence with Kernelized OMWU (KOMWU) -- the algorithm with state-of-the-art dependence on the game tree size in extensive-form games -- when used in conjunction with the online mirror descent (OMD) algorithm. However, the standard analysis for OMD is unable to establish such a result; the only current analysis is by appealing to the iterate equivalence to KOMWU. We close this gap by introducing a pair of primal-dual treeplex norms, which we contend form the natural analytic viewpoint for studying the strong convexity of DilEnt. Using these norm pairs, we recover the diameter-to-strong-convexity ratio that predicts the same performance as KOMWU. Along with a new regret lower bound for online learning in sequence-form strategy spaces, we show that this ratio is nearly optimal. Finally, we showcase our analytic techniques by refining the analysis of Clairvoyant OMD when paired with DilEnt, establishing an O(nlogVlogT/T)\mathcal{O}(n \log |\mathcal{V}| \log T/T) approximation rate to coarse correlated equilibrium in nn-player games, where V|\mathcal{V}| is the number of reduced normal-form strategies of the players, establishing the new state of the art

    Offline Reinforcement Learning with OOD State Correction and OOD Action Suppression

    Get PDF
    In offline reinforcement learning (RL), addressing the out-of-distribution (OOD) action issue has been a focus, but we argue that there exists an OOD state issue that also impairs performance yet has been underexplored. Such an issue describes the scenario when the agent encounters states out of the offline dataset during the test phase, leading to uncontrolled behavior and performance degradation. To this end, we propose SCAS, a simple yet effective approach that unifies OOD state correction and OOD action suppression in offline RL. Technically, SCAS achieves value-aware OOD state correction, capable of correcting the agent from OOD states to high-value in-distribution states. Theoretical and empirical results show that SCAS also exhibits the effect of suppressing OOD actions. On standard offline RL benchmarks, SCAS achieves excellent performance without additional hyperparameter tuning. Moreover, benefiting from its OOD state correction feature, SCAS demonstrates enhanced robustness against environmental perturbations.Accepted to NeurIPS 202

    Ising Disks

    Get PDF
    We introduce a dynamic model where the state space is the set of contractible cubical sets in the Euclidian space. The permissible state transitions, that is addition and removal of a cube to/from the set, is locally decidable. We prove that in the planar special case the state space is connected. We then define a continuous time Markov chain with a fugacity (tendency to grow) parameter. We prove that, on the plane, the Markov chain is irreducible (due to state connectivity), and is also ergodic if the fugacity is smaller than a threshold

    NASM: Neural Anisotropic Surface Meshing

    Get PDF
    This paper introduces a new learning-based method, NASM, for anisotropic surface meshing. Our key idea is to propose a graph neural network to embed an input mesh into a high-dimensional (high-d) Euclidean embedding space to preserve curvature-based anisotropic metric by using a dot product loss between high-d edge vectors. This can dramatically reduce the computational time and increase the scalability. Then, we propose a novel feature-sensitive remeshing on the generated high-d embedding to automatically capture sharp geometric features. We define a high-d normal metric, and then derive an automatic differentiation on a high-d centroidal Voronoi tessellation (CVT) optimization with the normal metric to simultaneously preserve geometric features and curvature anisotropy that exhibit in the original 3D shapes. To our knowledge, this is the first time that a deep learning framework and a large dataset are proposed to construct a high-d Euclidean embedding space for 3D anisotropic surface meshing. Experimental results are evaluated and compared with the state-of-the-art in anisotropic surface meshing on a large number of surface models from Thingi10K dataset as well as tested on extensive unseen 3D shapes from Multi-Garment Network dataset and FAUST human dataset.SIGGRAPH Asia 2024 (Conference Track

    Clean for Haskell Programmers

    Get PDF
    This note is meant to give people who are familiar with the functional programming language Haskell a concise overview of Clean language elements and how they differ from Haskell.5 page

    Larger models yield better results? Streamlined severity classification of ADHD-related concerns using BERT-based knowledge distillation

    Get PDF
    This work focuses on the efficiency of the knowledge distillation approach in generating a lightweight yet powerful BERT based model for natural language processing applications. After the model creation, we applied the resulting model, LastBERT, to a real-world task classifying severity levels of Attention Deficit Hyperactivity Disorder (ADHD)-related concerns from social media text data. Referring to LastBERT, a customized student BERT model, we significantly lowered model parameters from 110 million BERT base to 29 million, resulting in a model approximately 73.64% smaller. On the GLUE benchmark, comprising paraphrase identification, sentiment analysis, and text classification, the student model maintained strong performance across many tasks despite this reduction. The model was also used on a real-world ADHD dataset with an accuracy and F1 score of 85%. When compared to DistilBERT (66M) and ClinicalBERT (110M), LastBERT demonstrated comparable performance, with DistilBERT slightly outperforming it at 87%, and ClinicalBERT achieving 86% across the same metrics. These findings highlight the LastBERT model\u27s capacity to classify degrees of ADHD severity properly, so it offers a useful tool for mental health professionals to assess and comprehend material produced by users on social networking platforms. The study emphasizes the possibilities of knowledge distillation to produce effective models fit for use in resource-limited conditions, hence advancing NLP and mental health diagnosis. Furthermore underlined by the considerable decrease in model size without appreciable performance loss is the lower computational resources needed for training and deployment, hence facilitating greater applicability. Especially using readily available computational tools like Google Colab. This study shows the accessibility and usefulness of advanced NLP methods in pragmatic world applications.20 figures, 31 pages, review 1 from plos one journa

    The ISCSLP 2024 Conversational Voice Clone (CoVoC) Challenge: Tasks, Results and Findings

    Get PDF
    The ISCSLP 2024 Conversational Voice Clone (CoVoC) Challenge aims to benchmark and advance zero-shot spontaneous style voice cloning, particularly focusing on generating spontaneous behaviors in conversational speech. The challenge comprises two tracks: an unconstrained track without limitation on data and model usage, and a constrained track only allowing the use of constrained open-source datasets. A 100-hour high-quality conversational speech dataset is also made available with the challenge. This paper details the data, tracks, submitted systems, evaluation results, and findings.accepted by ISCSLP 202

    Meta-Sealing: A Revolutionizing Integrity Assurance Protocol for Transparent, Tamper-Proof, and Trustworthy AI System

    Get PDF
    The Artificial intelligence in critical sectors-healthcare, finance, and public safety-has made system integrity paramount for maintaining societal trust. Current verification methods for AI systems lack comprehensive lifecycle assurance, creating significant vulnerabilities in deployment of both powerful and trustworthy AI. This research introduces Meta-Sealing, a cryptographic framework that fundamentally changes integrity verification in AI systems throughout their operational lifetime. Meta-Sealing surpasses traditional integrity protocols through its implementation of cryptographic seal chains, establishing verifiable, immutable records for all system decisions and transformations. The framework combines advanced cryptography with distributed verification, delivering tamper-evident guarantees that achieve both mathematical rigor and computational efficiency. Our implementation addresses urgent regulatory requirements for AI system transparency and auditability. The framework integrates with current AI governance standards, specifically the EU\u27s AI Act and FDA\u27s healthcare AI guidelines, enabling organizations to maintain operational efficiency while meeting compliance requirements. Testing on financial institution data demonstrated Meta-Sealing\u27s capability to reduce audit timeframes by 62% while enhancing stakeholder confidence by 47%. Results can establish a new benchmark for integrity assurance in enterprise AI deployments. This research presents Meta-Sealing not merely as a technical solution, but as a foundational framework ensuring AI system integrity aligns with human values and regulatory requirements. As AI continues to influence critical decisions, provides the necessary bridge between technological advancement and verifiable trust. Meta-Sealing serves as a guardian of trust, ensuring that the AI systems we depend on are as reliable and transparent as they are powerful.24 pages, 3 figures and 10 Code blocks, to be presented in the conferenc

    Seven-octave ultrabroadband metamaterial absorbers via Q-weighted mode density modulation

    Get PDF
    Absorption is a crucial parameter in shaping wave propagation dynamics, yet achieving ultra-broadband absorption remains highly challenging, particularly in balancing low-frequency and broad bandwidth. Here, we present a metamaterial absorber (MMA) capable of achieving simultaneous spectral coverage across a seven-octave range of near-perfect absorption from 100 Hz to 12,800 Hz by engineering the quality-factor-weighted (Q-weighted) mode density. The Q-weighted mode density considers mode density, resonant frequencies, radiative loss, and intrinsic loss of multiple resonant modes, providing a comprehensive approach to govern broadband absorption properties. By optimizing the number of resonant modes and managing intrinsic losses, our approach achieves an intensive Q-weighted mode density across an ultra-wide bandwidth, enabling ultra-broadband absorption with high efficiency. These findings significantly advance the bandwidth capabilities of state-of-the-art MMAs and pave the way for the development of ultra-broadband metamaterial devices across various wave systems

    375,182

    full texts

    623,509

    metadata records
    Updated in last 30 days.
    arXiv.org e-Print Archive is based in United States
    Access Repository Dashboard
    Do you manage Open Research Online? Become a CORE Member to access insider analytics, issue reports and manage access to outputs from your repository in the CORE Repository Dashboard! 👇