• Login
    View Item 
    •   Home
    • Research
    • Articles
    • View Item
    •   Home
    • Research
    • Articles
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of KAUSTCommunitiesIssue DateSubmit DateThis CollectionIssue DateSubmit Date

    My Account

    Login

    Quick Links

    Open Access PolicyORCID LibguidePlumX LibguideSubmit an Item

    Statistics

    Display statistics

    ML-descent: An optimization algorithm for full-waveform inversion using machine learning

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    ML_descent_compressed-2.pdf
    Size:
    1.434Mb
    Format:
    PDF
    Description:
    Accepted manuscript
    Download
    Type
    Article
    Authors
    Sun, Bingbing cc
    Alkhalifah, Tariq Ali cc
    KAUST Department
    Physical Science and Engineering (PSE) Division
    Earth Science and Engineering Program
    Date
    2020-10-21
    Submitted Date
    2019-09-27
    Permanent link to this record
    http://hdl.handle.net/10754/667268
    
    Metadata
    Show full item record
    Abstract
    Full-waveform inversion (FWI) is a nonlinear optimization problem, and a typical optimization algorithm such as the nonlinear conjugate gradient or limited-memory Broyden-Fletcher-Goldfarb-Shanno (LBFGS) would iteratively update the model mainly along the gradient-descent direction of the misfit function or a slight modification of it. Based on the concept of meta-learning, rather than using a hand-designed optimization algorithm, we have trained the machine (represented by a neural network) to learn an optimization algorithm, entitled the “ML-descent,” and apply it in FWI. Using a recurrent neural network (RNN), we use the gradient of the misfit function as the input, and the hidden states in the RNN incorporate the history information of the gradient similar to an LBFGS algorithm. However, unlike the fixed form of the LBFGS algorithm, the machine-learning (ML) version evolves in response to the gradient. The loss function for training is formulated as a weighted summation of the L2 norm of the data residuals in the original inverse problem. As with any well-defined nonlinear inverse problem, the optimization can be locally approximated by a linear convex problem; thus, to accelerate the training, we train the neural network by minimizing randomly generated quadratic functions instead of performing time-consuming FWIs. To further improve the accuracy and robustness, we use a variational autoencoder that projects and represents the model in latent space. We use the Marmousi and the overthrust examples to demonstrate that the ML-descent method shows faster convergence and outperforms conventional optimization algorithms. The energy in the deeper part of the models can be recovered by the ML-descent even when the pseudoinverse of the Hessian is not incorporated in the FWI update.
    Citation
    Array
    Sponsors
    We thank the editor-in-chief J. Shragge for improving the manuscript. We appreciate the comments and suggestions by the assistant editor A. Guitton and the associate editor S. A. L. de Ridder in the reviewing process. We thank the members of SWAG at KAUST for the useful discussions.
    Publisher
    Society of Exploration Geophysicists
    Journal
    GEOPHYSICS
    DOI
    10.1190/geo2019-0641.1
    Additional Links
    http://mr.crossref.org/iPage?doi=10.1190%2Fgeo2019-0641.1
    ae974a485f413a2113503eed53cd6c53
    10.1190/geo2019-0641.1
    Scopus Count
    Collections
    Articles; Physical Science and Engineering (PSE) Division; Earth Science and Engineering Program

    entitlement

     
    DSpace software copyright © 2002-2021  DuraSpace
    Quick Guide | Contact Us | Send Feedback
    Open Repository is a service hosted by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items. For anonymous users the allowed maximum amount is 50 search results.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.