{"id":"https://openalex.org/W2904200035","doi":null,"title":"The Augmentation of Existing Data for Improving the Path of Steepest Ascent","display_name":"The Augmentation of Existing Data for Improving the Path of Steepest Ascent","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2904200035","mag":"2904200035"},"language":"fr","primary_location":{"id":"pmh:oai:HAL:inria-00386675v1","doi":null,"is_oa":false,"landing_page_url":"https://inria.hal.science/inria-00386675","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4405252976","host_organization_name":"Centre pour la Communication Scientifique Directe","host_organization_lineage":["https://openalex.org/I4405252976"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"41\u00e8mes Journ\u00e9es de Statistique, SFdS, Bordeaux, 2009, Bordeaux, France, France","raw_type":"info:eu-repo/semantics/conferenceObject"},"volume":null,"type":"conference-paper","indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Mehdi Kiani","orcid":"https://orcid.org/0000-0001-9310-8093","observed_orcids":["https://orcid.org/0000-0001-9310-8093"]},"institutions":[{"id":"https://openalex.org/I55547365","display_name":"Payame Noor University","ror":"https://ror.org/031699d98","country_code":"IR","type":"education","lineage":["https://openalex.org/I55547365"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Mehdi Kiani","raw_affiliation_strings":["Department of Statistics, Payame Noor University, Tehran, Iran"],"raw_orcid":"https://orcid.org/0000-0001-9310-8093","affiliations":[{"raw_affiliation_string":"Department of Statistics, Payame Noor University, Tehran, Iran","institution_ids":["https://openalex.org/I55547365"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I55547365"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.51271186,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.7451000213623047,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.7451000213623047,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.06360000371932983,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.018200000748038292,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/steepest-ascent-method","display_name":"steepest ascent","score":0.8009999990463257},{"id":"https://openalex.org/keywords/data-augmentation","display_name":"data augmentation","score":0.7559999823570251},{"id":"https://openalex.org/keywords/optimization-path","display_name":"optimization path","score":0.4269999861717224},{"id":"https://openalex.org/keywords/gradient-ascent","display_name":"gradient ascent","score":0.3840000033378601}],"concepts":[{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6560628414154053},{"id":"https://openalex.org/C185142706","wikidata":"https://www.wikidata.org/wiki/Q1134404","display_name":"Covariance matrix","level":2,"score":0.587103009223938},{"id":"https://openalex.org/C178650346","wikidata":"https://www.wikidata.org/wiki/Q201984","display_name":"Covariance","level":2,"score":0.5394331812858582},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5217519998550415},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5202832818031311},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49811458587646484},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.49633413553237915},{"id":"https://openalex.org/C195065555","wikidata":"https://www.wikidata.org/wiki/Q214881","display_name":"Curvature","level":2,"score":0.4725477397441864},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3776038885116577},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36071884632110596},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.34201353788375854},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15611082315444946},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:HAL:inria-00386675v1","doi":null,"is_oa":false,"landing_page_url":"https://inria.hal.science/inria-00386675","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4405252976","host_organization_name":"Centre pour la Communication Scientifique Directe","host_organization_lineage":["https://openalex.org/I4405252976"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"41\u00e8mes Journ\u00e9es de Statistique, SFdS, Bordeaux, 2009, Bordeaux, France, France","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"mag:2904200035","doi":null,"is_oa":false,"landing_page_url":"https://hal.inria.fr/inria-00386675","pdf_url":null,"source":{"id":"https://openalex.org/S4306499382","display_name":"41\u00e8mes Journ\u00e9es de Statistique, SFdS, Bordeaux","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"41\u00e8mes Journ\u00e9es de Statistique, SFdS, Bordeaux","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W7099438542","https://openalex.org/W163294739","https://openalex.org/W1533381739","https://openalex.org/W4239394714","https://openalex.org/W2109257755","https://openalex.org/W2093909576","https://openalex.org/W3012100611","https://openalex.org/W2008604324","https://openalex.org/W2773806087","https://openalex.org/W1977673212"],"abstract_inverted_index":{"Response":[0],"surface":[1,50],"methodology":[2],"is":[3,27,36,52,64,88,158],"a":[4,23,45,80],"collection":[5],"of":[6,19,25,95,105,107,120,150,154],"mathematical":[7],"and":[8,17,33,70,147],"statistical":[9],"techniques":[10],"that":[11,51,124],"are":[12,43,128],"useful":[13],"for":[14],"the":[15,34,48,55,59,68,71,84,99,103,108,118,125,139,145,148,151,155],"modeling":[16],"analysis":[18],"problems":[20],"in":[21,67,93,98,114],"which":[22],"response":[24,49],"interest":[26],"influenced":[28],"by":[29],"several":[30],"independent":[31,126],"variables":[32,127],"objective":[35],"to":[37,90,132],"optimize":[38],"this":[39,143],"response.":[40,100],"When":[41],"we":[42,112,137],"at":[44],"point":[46],"on":[47],"remote":[53],"from":[54],"optimum,":[56],"such":[57,123],"as":[58,83],"current":[60],"operating":[61],"conditions":[62],"there":[63],"little":[65],"curvature":[66],"system":[69],"first-order":[72],"model":[73],"will":[74],"be":[75],"appropriate.":[76],"In":[77],"these":[78],"circumstances,":[79],"preliminary":[81],"procedure":[82],"steepest":[85,109],"ascent":[86,110],"usually":[87],"employed":[89],"move":[91],"sequentially":[92],"direction":[94],"maximum":[96],"increase":[97],"To":[101],"improve":[102],"estimation":[104],"parameters":[106],"path,":[111],"present,":[113],"an":[115],"efficient":[116],"way,":[117],"augmentation":[119],"existing":[121],"data":[122],"made":[129],"more":[130],"orthogonal":[131],"each":[133],"other.":[134],"Additionally,":[135],"when":[136],"estimate":[138],"true":[140],"path":[141,157],"using":[142],"method,":[144],"bias":[146],"magnitude":[149],"covariance":[152],"matrix":[153],"estimated":[156],"decreased,":[159],"significantly.":[160]},"counts_by_year":[],"updated_date":"2026-10-25T09:29:13.331239","created_date":"2018-12-22T00:00:00"}